Problem Description

Professor Scramble noticed spelling mistakes in a research paper she was reviewing, but she had no difficulty in reading or understanding the words. Upon doing some research, she found an interesting article as described below:

According to a study at an English University, it doesn't matter in what order the letters in a word are, the only important thing is that the first and last letter be at the correct place. The rest can be a total mess and you can still read it without a problem. This is because the human mind does not read every letter by itself but the word as a whole.

Or rather ...

Aoccdrnig to a study at an Elingsh uinertvis, it deosn't mttaer in waht oredr the ltteers in a wrod are, the olny iprmoetnt tiing is taht the frist and lsat ltteer be at the coreect pclae. The rset can be a toatl mses and you can sitll raed it wouthit a porblem. Tihs is bcuseae the huaamn mnid deos not raed ervey lleter by istlef, but the wrod as a whohle.

Professor Scramble wants to explore this concept further and starts compiling different sentences containing similarly scrambled words to send to a popular publication. Unfortunately, the space key on the professor's keyboard is not working, so she has produced one long string of characters. She has asked you to determine how many of the words in her dictionary appear (at least once) as substrings in the long string of characters, either in their original or scrambled forms. (A scrambled form consists of the same set of letters with the first and last letters in the same places, and the others in any order.)

Note that a dictionary word can appear multiple times in the string (though it should be counted only once since we only need to know whether it shows up at least once). For example, if we had the word this in the dictionary, the possible valid words which would be counted are this (original version) and tihs (scrambled version), whereas tsih, siht and other variations are not valid since they do not start with t and end with s. Also, tis, tiss, and thiss are not scrambled forms, because they are not reorderings of the original set of letters.

Since the professor is extremely busy, she gives this task to you, her favorite and most trusted research assistant. Given a dictionary, can you count the number of words in the dictionary that appear as a substring in the professor's string at least once, in either their scrambled or original forms.

Input Format

The first line of the input gives the number of test cases, $T$. $T$ test cases follow. Each testcase contains three lines. The first line contains an integer $L$. The second line contains a list of $L$ words made of lowercase English letters; these make up the dictionary. The third line contains two lowercase English letters $S_1$ and $S_2$, and five integers $N$, $A$, $B$, $C$ and $D$. $S_1$ and $S_2$ are the first two characters of the professor's string $S$, $N$ is the length of $S$, and the other four integers are parameters that you should use to generate the characters of $S$, as follows:

First we define $\text{ord}(c)$ as the decimal value of a character $c$ and $\text{char}(n)$ as the character value of a decimal $n$. For example, $\text{ord}(\text{`a'}) = 97$ and $\text{char}(97) = \text{`a'}$. You can refer to ASCII table for other conversions.

Now, define $x_1 = \text{ord}(S_1)$, $x_2 = \text{ord}(S_2)$. Then, use the recurrence below to generate $x_i$ for $i = 3$ to $N$:

• $x_i = (A \times x_{i-1} + B \times x_{i-2} + C ) \text{ modulo } D$.

We define $S_i = \text{char}(97 + (x_i \text{ modulo } 26 ))$, for all $i = 3$ to $N$.

Output Format

For each test case, output one line containing Case #x: y, where $x$ is the test case number (starting from $1$) and $y$ is the number of words from the dictionary that appear (in their original or scrambled forms, as defined above) as substrings of the given string.

1
5
axpaj apxaj dnrbt pjxdn abd
a a 50 1 1 1 30

Case #1: 4

Hint

In Sample Case #1, using the generation method, the generated string $S$ is aapxjdnrbtvldptfzbbdbbzxtndrvjblnzjfpvhdhhpxjdnrbt.

Note: We do not recommend using interpreted/slower languages for the Large dataset of this problem.

Limits

$1 \le T \le 20$.

No two words in the dictionary are the same.

Each word in the dictionary is between $2$ and $10^5$ letters long, inclusive.

The sum of lengths of all words in the dictionary does not exceed $10^5$.

${S_1}$ and ${S_2}$ are lowercase English letters.

$0 \le {A} \le 10^9$.

$0 \le {B} \le 10^9$.

$0 \le {C} \le 10^9$.

$1 \le {D} \le 10^9$.

Small dataset (Test set 1 - Visible)

$1 \le L \le 1000$.

$2 \le N \le 1000$.

Large dataset (Test set 2 - Hidden)

$1 \le L \le 20000$.

$2 \le N \le 10^6$.