In English, there are 26 letters that are either vowels or consonants. In this problem, we consider a, e, i, o, and u to be vowels, and the other 21 letters to be consonants.
A tribe living in the Greatest Colorful Jungle has a tradition of naming their members using English letters. But it is not easy to come up with a good name for a new member because it reflects the member's social status within the tribe. It is believed that the less common the name he or she is given, the more socially privileged he or she is.
The leader of the tribe is a professional linguist. He notices that
hard-to-pronounce names are uncommon, and the reason is that they have
too many consecutive consonants. Therefore, he announces that the social status of a member in the tribe is determined by its
All members in the tribe must have their names and n given by
the leader. Although the leader is a linguist and able to ensure that
the given names are meaningful, he is not good at calculating the
The first line of the input gives the number of test cases, T. T test cases follow. The first line of each test case gives the name of a member as a string of length L, and an integer n. Each name consists of one or more lower-case English letters.
For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the
1 ≤ T ≤ 100.
0 < n ≤ L.
1 ≤ L ≤ 100.
1 ≤ L ≤ 106.
The input file will be no larger than 6MB.