Problem:
Score : 1100 points

Problem Statement

There are N strings of lowercase alphabet only. The i-th string is S_i. Every string is unique.

Provide answers for the Q queries below. The i-th query has the following format:

Query: An integer k_i and a string p_{i,1}p_{i,2}...p_{i,26} that results from permuting {a,b,...,z} are given. Output the sequence of the string S_{k_i} among the N strings in lexicographical order when the literal sequence is p_{i,1}<p_{i,2}<...<p_{i,26}.

Constraints

1 ≦ N,Q ≦ 100000

1 ≦ |S_i| (1 ≦ i ≦ N)

S_i (1 ≦ i ≦ N) is a string of lowercase alphabet.

The sum of |S_i| is no more than 400000.

Every S_i is unique.

1 ≦ k_i ≦ N (1 ≦ i ≦ Q)

For all 1 ≦ i ≦ Q, p_{i,1}p_{i,2}...p_{i,26} is a permutation of abcd...z.

Input

Inputs are provided from standard inputs in the following form.

N
S_1
:
S_N
Q
k_1 p_{1,1}p_{1,2}...p_{1,26}
:
k_Q p_{Q,1}p_{Q,2}...p_{Q,26}

Output

Output Q lines.

On line i, for the i-th query, output an integer indicating the sequence of the string S_{k_i} among the N strings in lexicographical order.

Sample Input 1

5
aa
abbaa
abbba
aaab
aaaaaba
5
1 abcdefghijklmnopqrstuvwxyz
2 bacdefghijklmnopqrstuvwxyz
3 abcdefghijklmnopqrstuvwxyz
4 bacdefghijklmnopqrstuvwxyz
5 abcdefghijklmnopqrstuvwxyz

Sample Output 1

1
2
5
4
2

When the literal sequence is a < b, sorting the input strings in lexicographical order yields aa, aaaaaba, aaab, abbaa, abbba. The answers to queries 1, 3, and 5 are thus 1, 5, and 2, respectively.

When the literal sequence is b < a, sorting the input strings in lexicographical order yields abbba, abbaa, aa, aaab, aaaaaba. The answers to queries 2 and 4 are thus 2 and 4, respectively.

Sample Input 2

8
abrakatabra
abadaba
abracadabra
atcoder
grand
contest
ababa
a
6
3 abcdefghijklmnopqrstuvwxyz
6 qwertyuiopasdfghjklzxcvbnm
8 poiuytrewqlkjhgfdsamnbvcxz
2 qazwsxedcrfvtgbyhnujmikolp
1 plokmijnuhbygvtfcrdxeszwaq
4 mnbvcxzasdfghjklpoiuytrewq

Sample Output 2

4
8
2
3
4
7

Solution in C++14 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>

using namespace std;

#define forn(i,n) for(int i=0;i<(int)(n); i++)
#define forsn(i,s,n) for(int i=(s);i<(int)(n); i++)
#define pb push_back

struct node{
	int prefijos;
	bool isLeaf;
	struct node * child[26];
}* head;

void init(){
	head=new node();
	head->prefijos=0;
	head->isLeaf=false;
}

int maxi=0;

void insert(string word)
{
	node *current = head;
	current->prefijos++;
	
	for(int i = 0 ; i < word.length(); ++i)
	{
		int letter = (int)word[i] - (int)'a';	//extrct first character of word
		if(current->child[letter] == NULL)
			current->child[letter] = new node();

		current->child[letter]->prefijos++;
		current = current->child[letter];		
	}
	current->isLeaf=true;
}

int get(string quiero, string abc, int voy, node *estoy){
	if(quiero.size()==0)return voy;
	forn(i, abc.size()){
		if(abc[i]!=quiero[0]){
			int letter = (int)abc[i] - (int)'a';	//extrct first character of word
			if(estoy->child[letter]){
				voy+=(estoy->child[letter]->prefijos);
			}	
		}else{
			int letter = (int)quiero[0] - (int)'a';	//extrct first character of word
			if(estoy->isLeaf)voy++;
			return get(quiero.substr(1), abc, voy, estoy->child[letter]);
		}
	}
}

int main (){
	int n;
	cin>>n;
	init();
	vector<string> vs;
	forn(i, n){
		string s;
		int prefi;
		cin>>s;
		vs.pb(s);
		insert(s);
	}
	int q;
	cin>>q;
	while(q--){
		string abc;
		int pos;
		cin>>pos>>abc;
		string quiero=vs[pos-1];
		node *current = head;
		cout<<get(quiero, abc, 0, current)+1<<endl;
	}
}