Special Words#4345
In combinatorics on words, a special word is defined by the following properties: it contains only the first letters of the English alphabet and is a -repetition, i.e., it can be represented as the concatenation of identical words. Furthermore, to make the word strictly special, no proper substring of it can be a -repetition.
Your task is to count the number of such words that consist of at most letters.
The first line contains space-separated integers , , (1 \leq m \leq 18; 2 \leq k \leq 5; 1 \leq n \leq 22).
Output the required number of special words.
Example 1