CodeForces462B

Appleman and Card Game

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 462B

Description

Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you should calculate how much Toastman's cards have the letter equal to letter on ith, then sum up all these quantities, such a number of coins Appleman should give to Toastman.

Given the description of Appleman's cards. What is the maximum number of coins Toastman can get?

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤ 10⁵). The next line contains n uppercase letters without spaces — the i-th letter describes the i-th card of the Appleman.

Output

Print a single integer – the answer to the problem.

Sample Input

Input

15 10
DZFDFZDFDDDDDDF

Output

82

Input

6 4
YJSNPI

Output

4

//2016.8.2
#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

int ch[30];

bool cmp(int a, int b)
{
    return a>b;
}

int min(int a, int b)
{
    return a > b ? b : a;
}

int main()
{
    int n, k;
    long long ans, x;
    char c;
    while(cin >> n >> k)
    {
        memset(ch, 0, sizeof(ch));
        getchar();
        ans = 0;
        for(int i = 0; i < n; i++)
        {
            c = getchar();
            ch[c-'A']++;
        }
        sort(ch, ch+26, cmp);

        for(int i = 0; k > 0;i++)
        {
            x = min(k, ch[i]);
            ans += x*x;
            k -= x;
        }
        cout << ans << endl;
    }
    return 0;
}