CodeForces - 462B（思维题）

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 ≤ 105). 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.

Examples

Input

15 10
DZFDFZDFDDDDDDF

Output

82

Input

6 4
YJSNPI

Output

4

Note

In the first test example Toastman can choose nine cards with letter D and one additional card with any letter. For each card with D he will get 9 coins and for the additional card he will get 1 coin.

分析：输入一个n个数的序列，再找到k个数使得给的硬币数最多。

硬币数的计算方法是n个相同数的平方。

排序然后再找到最大的个数的数，剩下的k值如果小于下一个要取的数的数量的话，判断是否大于1,。

最后注意一下用long long就可以了

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int  num[26];
long long temp[26];
int n, k;
bool cmp(int a, int b)
{
    return a > b;
}
int main()
{
    double sum = 0;
    while (~scanf("%d%d", &n, &k))
    {
        getchar();
        sum  = 0;
        memset(num, 0, sizeof(num));
        for (int i = 0; i < n; i++)
        {
            char temp;
            scanf("%c", &temp);
            num[temp-'A']++;
        }
        sort(num, num+26, cmp);
        for (int i = 0; i < 26; i++)
        {
            temp[i] = min(num[i], k);
            k -= num[i];
            if (k <= 0) break;
        }
        for (int i = 0; i < 26; i++)
        {
            sum+= temp[i]*temp[i];
        }
        printf("%.0lf\n", sum);
    }
    return 0;

}