B"You're a linguist studying a mysterious ancient language. You know that You have a single text written in this language. Unfortunately, as the language is really ancient, spaces between words are missing and all letters are uppercase. You wonder what is the minimum number of cases the language can have. Can you find this out? Each test consists of several test cases. The first line contains a single integer t ( 1 <= t <= 10 ,000 ) -- the number of test cases. It is followed by descriptions of the test cases. The first line of each test case contains three integers n , c , k ( 1 <= k <= n <= 2^{18} , 1 <= c <= 18 ) -- the length of the text, the number of letters in the language, and the maximum length of the word. The second line contains a string of n characters -- the text itself. Each character is one of the first c uppercase letters of the Latin alphabet. It is guaranteed that the sum of n over all test cases does not exceed 2^{18} and the sum of 2^c over all test cases does not exceed 2^{18} . For each test case, output a single line consisting of a single integer -- the minimum number of cases in the language. In the first test case, there must be five cases in the language (for each of the letters 'A', 'B', 'C', 'D', and 'E' there must be a case that has a corresponding ending). In the fourth test case, one case with ending 'B' is sufficient. "...