#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
struct Trie {
	int cnt;
	Trie* ptr[29];
	Trie() { cnt = 0; fill(ptr, ptr + 27, (Trie*)0); }
};
Trie* root = new Trie;
void add(string str) {
	Trie* pos = root; pos->cnt++;
	for (int i = 0; i < str.size(); i++) {
		if (!pos->ptr[str[i] - 96]) pos->ptr[str[i] - 96] = new Trie;
		pos = pos->ptr[str[i] - 96];
		pos->cnt++;
	}
}
int N, Q, x, val[100009][29][29]; string s[100009], t;
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> s[i]; s[i] += '`';
		add(s[i]);
	}
	for (int i = 0; i < N; i++) {
		Trie* pos = root;
		for (int j = 0; j < s[i].size(); j++) {
			for (int k = 0; k < 27; k++) {
				if (pos->ptr[k]) val[i][s[i][j] - 96][k] += pos->ptr[k]->cnt;
			}
			pos = pos->ptr[s[i][j] - 96];
		}
	}
	cin >> Q;
	while (Q--) {
		cin >> x >> t; x--;
		t = '`' + t;
		int ret = N;
		for (int i = 0; i < 27; i++) {
			for (int j = i + 1; j < 27; j++) {
				ret -= val[x][t[i] - 96][t[j] - 96];
			}
		}
		cout << ret << "\n";
	}
	return 0;
}
### Prompt

Please create a solution in Cpp to the following problem:

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.

Examples

Input

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


Output

1
2
5
4
2


Input

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


Output

4
8
2
3
4
7

### Response

```cpp
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
struct Trie {
	int cnt;
	Trie* ptr[29];
	Trie() { cnt = 0; fill(ptr, ptr + 27, (Trie*)0); }
};
Trie* root = new Trie;
void add(string str) {
	Trie* pos = root; pos->cnt++;
	for (int i = 0; i < str.size(); i++) {
		if (!pos->ptr[str[i] - 96]) pos->ptr[str[i] - 96] = new Trie;
		pos = pos->ptr[str[i] - 96];
		pos->cnt++;
	}
}
int N, Q, x, val[100009][29][29]; string s[100009], t;
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> s[i]; s[i] += '`';
		add(s[i]);
	}
	for (int i = 0; i < N; i++) {
		Trie* pos = root;
		for (int j = 0; j < s[i].size(); j++) {
			for (int k = 0; k < 27; k++) {
				if (pos->ptr[k]) val[i][s[i][j] - 96][k] += pos->ptr[k]->cnt;
			}
			pos = pos->ptr[s[i][j] - 96];
		}
	}
	cin >> Q;
	while (Q--) {
		cin >> x >> t; x--;
		t = '`' + t;
		int ret = N;
		for (int i = 0; i < 27; i++) {
			for (int j = i + 1; j < 27; j++) {
				ret -= val[x][t[i] - 96][t[j] - 96];
			}
		}
		cout << ret << "\n";
	}
	return 0;
}
```