The Still Embarrassed Cryptographer

The cryptographer Borge is writing a new security module for his company. Nobody could read his code in the previous module and it caused a lot of trouble, so his boss told him to keep this one much simpler.

The secret key $c$ is a one to one map from the 26 uppercase letters onto the 26 uppercase letters. For a string $S = s_1 s_2 \dots s_m$ the module computes $\mathrm{crypt}(S) = c(s_1) c(s_2) \dots c(s_m)$, and the decryption key $c^{-1}$ satisfies $c^{-1}(c(s)) = s$.

The scheme has a weakness. For some $q$ the identity $\mathrm{crypt}^q(\mathrm{crypt}(S)) = S$ holds, so an attacker only has to keep encrypting the ciphertext until readable text appears. A small $q$ is dangerous, so Borge needs $q$ first.

You are given a plaintext $S$ and the matching ciphertext $T = \mathrm{crypt}(S)$. Here $q$ is the smallest non-negative integer such that applying $\mathrm{crypt}$ to $T$ another $q$ times gives $S$ back.

The pair $S$ and $T$ reveals the value of $c$ only on the letters that occur in $S$, and the images of the other letters stay unknown. If every key $c$ that agrees with $S$ and $T$ gives the same $q$, print that value. If the value of $q$ depends on the key, print mjau.

The first line has the number of test cases $n$ ($1 \le n \le 100$). Each test case consists of two lines, the plaintext $S$ on the first line and the ciphertext $T$ on the second. At least one key satisfies $\mathrm{crypt}(S) = T$. Both strings use only the uppercase letters 'A' to 'Z', and $1 \le |S| = |T| \le 1000$. The encryption function $c$ is different in each test case.

For each test case print $q$ on its own line. If $S$ and $T$ alone do not determine $q$, print mjau.