K-String

We will call a string $K$-String if it consists of $K$ distinct characters. For example, if $K$ is 3 then “abc”, “aabbcc”, “xyaaaa” are $K$-String whereas “abcd”, “ddhhnnggs” are not.

In one move, you can replace any one character of the given string by any other lower case English alphabet. Your task is to find the minimum number of moves required to make a string $K$-String.

It is guaranteed that you can always convert the given string into a $K$-string by performing zero or more moves.

Input

The first line of the input contains two integers $N$ ($1 ≤ N ≤ 10^6$), denoting the size of the string and $K$ ($1 ≤ K ≤ 26$), denoting the number of distinct characters required.

Output

Output the minimum number of moves required to make the given string a $K$-String.

Samples

4 3
abcd

1

5 3
abcdd

1