The Dutch computer scientist Edsger Dijkstra made many important contributions to the field, including the shortest path finding algorithm that bears his name. This problem is not about that algorithm.

You were marked down one point on an algorithms exam for misspelling "Dijkstra" -- between D and stra, you wrote some number of characters, each of which was either i, j, or k. You are prepared to argue to get your point back using quaternions, an actual number system (extended from complex numbers) with the following multiplicative structure:

$${\displaystyle \begin{array}{ccccc}\times & 1& i& j& k\\ 1& 1& i& j& k\\ i& i& -1& k& -j\\ j& j& -k& -1& i\\ k& k& j& -i& -1\end{array}}$$

To multiply one quaternion by another, look at the row for the first quaternion and the column for the second quaternion. For example, to multiply $i$ by $j$, look in the row for $i$ and the column for $j$ to find that the answer is $k$. To multiply $j$ by $i$, look in the row for $j$ and the column for $i$ to find that the answer is $-k$.

As you can see from the above examples, the quaternions are not commutative -- that is, there are some $a$ and $b$ for which $a\ast b\ne b\ast a$. However they are associative -- for any $a$, $b$, and $c$, it's true that $a\ast (b\ast c)=(a\ast b)\ast c$.

Negative signs before quaternions work as they normally do -- for any quaternions $a$ and $b$, it's true that $-a\ast -b=a\ast b$, and $-a\ast b=a\ast -b=-(a\ast b)$.

You want to argue that your misspelling was equivalent to the correct spelling ijk by showing that you can split your string of is, js, and ks in two places, forming three substrings, such that the leftmost substring reduces (under quaternion multiplication) to $i$, the middle substring reduces to $j$, and the right substring reduces to $k$. (For example, jij would be interpreted as $j\ast i\ast j$; $j\ast i$ is $-k$, and $-k\ast j$ is $i$, so jij reduces to $i$.) If this is possible, you will get your point back. Can you find a way to do it?

Input Specification

The first line of the input gives the number of test cases, $T$. $T$ test cases follow. Each consists of one line with two space-separated integers $L$ and $X$, followed by another line with $L$ characters, all of which are i, j, or k. Note that the string never contains negative signs, 1s, or any other characters. The string that you are to evaluate is the given string of $L$ characters repeated $X$ times. For instance, for $L=4$, $X=3$, and the given string kiij, your input string would be kiijkiijkiij.

Output Specification

For each test case, output one line containing "Case #x: y", where $x$ is the test case number (starting from 1) and $y$ is either YES or NO, depending on whether the string can be broken into three parts that reduce to i, j, and k, in that order, as described above.

Limits

Memory limit: 1 GB.

$1\le T\le 100$.

$1\le L\le 10000$.

Small dataset

Time limit: 30 seconds.

$1\le X\le 10000$.

$1\le L\ast X\le 10000$.

Large dataset

Time limit: 60 seconds.

$1\le X\le {10}^{12}$.

$1\le L\ast X\le {10}^{16}$.

Sample Input

5
2 1
ik
3 1
ijk
3 1
kji
2 6
ji
1 10000
i

Sample Output

Case #1: NO
Case #2: YES
Case #3: NO
Case #4: YES
Case #5: NO

In Case #1, the string is too short to be split into three substrings.

In Case #2, just split the string into i, j, and k.

In Case #3, the only way to split the string into three parts is k, j, i, and this does not satisfy the conditions.

In Case #4, the string is jijijijijiji. It can be split into jij (which reduces to i), iji (which reduces to j), and jijiji (which reduces to k).

In Case #5, no matter how you choose your substrings, none of them can ever reduce to a j or a k.

Note

This problem has different time limits for different batches. If you exceed the Time Limit for any batch, the judge will incorrectly display >60.000s regardless of the actual time taken. Refer to the Limits section for batch-specific time limits.

This problem originally had a much higher time limit. However, as reference solutions were much faster, the Time Limit was been reduced accordingly.