#include <bits/stdc++.h>
using namespace std;

const int N = 100010;

class Node {
public:
	bool is_terminal;
	int cnt;
	Node *son[26];

	Node() {
		is_terminal = false;
		cnt = 0;
		for (int i = 0; i < 26; i++)
			son[i] = nullptr;
	}
};

class Trie {
public:
	Node *root;

	Trie() {
		root = new Node();
	}

	void insert(string &s) {
		Node *cur = root;
		for (char c: s) {
			int num = c - 'a';
			if (!cur->son[num]) 
				cur->son[num] = new Node();
			cur = cur->son[num];
			cur->cnt++;
		}
		cur->is_terminal = true;
	}
};


int n, q, calc[N][26][26], pref[N];
string s[N];

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n;
	Trie *trie = new Trie();
	for (int i = 1; i <= n; i++) {
		cin >> s[i];
		trie->insert(s[i]);
	}
	for (int i = 1; i <= n; i++) {
		Node *cur = trie->root;
		for (char c: s[i]) {
			int num = c - 'a';
			for (int j = 0; j < 26; j++) 
				if (j != num && cur->son[j]) 
					calc[i][num][j] += cur->son[j]->cnt;
			cur = cur->son[num];
			if (cur->is_terminal) pref[i]++;
		}
	}
	cin >> q;
	while (q--) {
		int k, ans = 0;
		string alpha;
		cin >> k >> alpha;
		vector<int> order(26);
		for (int i = 0; i < 26; i++)
			order[alpha[i] - 'a'] = i;
		for (int i = 0; i < 26; i++)
			for (int j = 0; j < 26; j++) 
				if (order[i] > order[j])
					ans += calc[k][i][j];
		cout << ans + pref[k] << '\n';
	}
}
