Double Trouble

Alice and her sister Irene frequently send each other e-mails. Wary of interception and wishing to keep their correspondence private, they encrypt each message in two steps. First they remove every non-alphabetic character and convert all letters to upper case (call the result the modified plaintext); then they:

1. replace each letter by the letter $s$ positions later in the alphabet ($1 \le s \le 25$) — call this a shift by $s$. The alphabet wraps around, so for example when $s = 2$, Y becomes A and Z becomes B.
2. divide the result of step 1 into groups of $m$ letters ($5 \le m \le 20$) and reverse the letters within each group. If the total length is not divisible by $m$, only the last $k$ letters ($k < m$) are reversed.

For example, let $s = 2$ and $m = 6$. If the plaintext is Meet me in St. Louis, Louis., then after removing non-alphabetic characters and converting to upper case the modified plaintext is:

MEETMEINSTLOUISLOUIS

Shifting each letter by 2 gives the intermediate result:

OGGVOGKPUVNQWKUNQWKU

Finally, reversing every group of 6 letters gives (the last two letters form the final group):

GOVGGOQNVUPKWQNUKWUK

By convention the result is written in groups of 5 letters, so the ciphertext is:

GOVGG OQNVU PKWQN UKWUK

Once a ciphertext is intercepted it is not very hard to recover $s$ and $m$, and it is even easier if you know a crib — a word that appears in the modified plaintext. In the example above, LOUIS is a crib. Your task is to find $s$ and $m$ given a ciphertext and a crib.

The input consists of several problem instances. The first line contains a positive integer giving the number of instances.

Each instance spans several lines. Its first line contains the integer $n$ ($20 \le n \le 500$), equal to the number of characters in the ciphertext. The following lines contain the ciphertext, all upper case, in groups of 5 letters separated by a single space (the last group may contain fewer than 5 letters). There are 10 groups per line, except possibly for the last line of ciphertext. The line following the last line of ciphertext contains the crib: a single word of between 4 and 10 upper-case characters, inclusive.

Output the two integers $s$ and $m$ on a single line, separated by one space, giving the encryption key that produces the crib, where $s$ is the shift and $m$ is the reversed-group size. If there is more than one solution, output the one with the smallest $s$; if several share the smallest $s$, output the one with the smallest $m$. If no such $s$ and $m$ exist, output Crib is not encrypted.