Problem F
Genefinderx9000

Bobby is a biology researcher with a great interest in genetics.
He loves to wander out in the wild collecting new DNA samples for his database which he later uses for his research.
He has to find exact matches to genetic patterns in the DNA of the animals he has collected. However, it takes Bobby multiple weeks to manually check which animals contain the exact sequences of DNA he is looking for, so he could use a little help.
Your task is to write a program that Bobby can use to find all the animals that contain a specific DNA sequence in his database.

Input

The first line of input has a single integer $\textrm{I}$ the number of animals in the database.
Each of the following $\textrm{I}$ lines depicts the genes of $\textrm{animal}_\textrm {n}\, $as an unique non-empty string.
The combined length of the $\textrm{I}$ animals is promised to never exceed $10^6$.
Following the $\textrm{I}$ lines is a single integer $\textrm{K}$. The next $\textrm{K}$ lines depicts a $\textrm{query}_\textrm {k}$ as an unique non-empty string. The total length of the $\textrm{K}$ queries is promised to never exceed $10^6$.

Both the $\textrm{I}$ animals and the $\textrm{K}$ queries consist exclusively of characters from the gene alphabet $\alpha $ (see equation 1).

Output

Given a database of animal genes you are to output the answer to each query on a single line.
For simplicity the animals are numbered from $0$ to $I-1$.
The answer to $\textrm{query}_\textrm {k}$ should be given as $Z \, \, z_0 \, \cdots \, \textrm{z}_{\textrm{Z}-1}$, where $Z$ denotes the count
of animals containing the k’th sequence and $\textrm{z}_0 \, \cdots \, \textrm{z}_{\textrm{Z}-1}$ is a space-separated integer set of the $Z$ animals.
The $\textrm{Z}$ animals should be given in ascending order such that $\textrm{animal}_\textrm {j} \leq \textrm{z}_{\textrm{j}+1}$ for all $\textrm{z} \, \epsilon \, \{ \, 0\, ,\cdots \, ,\textrm{Z}-1\, \} $.

4
AGGT
CAAGACT
CATA
GACTTT
3
ACT
G
CA

2 1 3
3 0 1 3
2 1 2

5
CCACACCGTTAAGGT
AAACCCAAAGGA
GAAAATTGGGGGGGGA
AACCGGGAAA
AACAGGTAA
4
AAC
CA
T
TGGA

3 1 3 4
3 0 1 4
3 0 2 4
0