-What is the essence of human beings!
-What is the essence of human beings!
-What is the essence of human beings!
This conversation happens every day, as we can see that the essence of human beings is repeaters.
One day HRY is chatting with n repeaters. Soon the conversation became a mess because everyone begins to repeat. Some repeaters repeat a word many times, some repeaters with low quality make spelling mistakes, and some are repeating other repeaters. Now, given the sentence every repeater says, HRY wants to know that given a word, how many times the repeaters from l to r has repeated it? Assume that the sentence spoken by a repeater is S with length n, the word is string T with length m, the times the repeater repeats this word is defined as the number of different positions k where .

The first line contains an integer n, indicating the number of repeaters.
The next n lines each contains a string , which is the sentence spoken by the ith repeater.
The next line contains an integer Q, indicating the number of queries. 
The next Q lines each contains two integers l',r', and a string . Pay attention, you should do following operations to get the real l,r :


 means bitwise xor operation, lastans is the ans of last query, if last query not exist, lastans=0.
.
All strings contain only lowercase letters. It is guaranteed that the total length of  does not exceed 300000, the total length of  does not exceed 300000.

For each of the Q queries, output a line which contains an integer representing total repeat times of string  by repeaters from l to r ( not l' to r' ).

3
gugugu
gugugu
guguguuuuuuu
2
1 2 gu
7 5 guu

6
1