CF Equality (水题)

You are given a string ss of length nn, which consists only of the first kk letters of the Latin alphabet. All letters in string ss are uppercase.

A subsequence of string ss is a string that can be derived from ss by deleting some of its symbols without changing the order of the remaining symbols. For example, "ADE" and "BD" are subsequences of "ABCDE", but "DEA" is not.

A subsequence of ss called good if the number of occurences of each of the first kkletters of the alphabet is the same.

Find the length of the longest good subsequence of ss.

Input

The first line of the input contains integers nn (1≤n≤1051≤n≤105) and kk (1≤k≤261≤k≤26).

The second line of the input contains the string ss of length nn. String ss only contains uppercase letters from 'A' to the kk-th letter of Latin alphabet.

Output

Print the only integer — the length of the longest good subsequence of string ss.

Examples

Input

9 3 ACAABCCAB

Output

6

 

 

 

 

 

 

 

Input

9 4 ABCABCABC

Output

0

 

 

 

 

 

 

 

 

这道题当时没读懂题，第二天想了一早上都没想明白什么意思，觉得这题可能超过了自己的知识范围，网上一搜才发现是道水题，错过了这道题，我也是很困惑。

废话不多说，其实这题和最长公共上升子序列一点关系都没有，它的要求只是求一个good子序列，即各个字母的数量相同就可以，和顺序没有关系。所以只要求出出现次数最少的字母的数量乘于k就是答案。

代码如下

#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;
int main() {
    int n,k,num[30],maxt=1000000;
    char c;
    memset(num,0, sizeof(num));
    scanf("%d %d",&n,&k);

    getchar();   //吸收上一行的回车
    for(int i=0;i<n;i++){
        scanf("%c",&c);
        num[c-'A']++;     //把A 看成0 B 看成 1 ，依次类推
    }

    for(int i=0;i<k;i++)
    {
        if(num[i]==0)      //判断特例，字符串中缺少一个或多个前k个字符
        {
            printf("0\n");
            return 0;
        }
    }

    for(int i=0;i<30;i++)
    {
        if(num[i]!=0)
            maxt=min(maxt,num[i]);
    }

    printf("%d\n",maxt*k);

    return 0;
}