///Author: MNTT - Tien Giang High School for the Gifted
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define ALL(a) a.begin(), a.end()
#define REP(i, n) for(auto i = 0; i < (n); ++i)
#define FOR(i, a, b) for(auto i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(auto i = (a); i >= (b); --i)
const int N = 1e6 + 5;
const int MOD = 998244353;
const int INF = 2e9;
int n, q;
string a[N];
int encode(char c) {
if (c == 'A') return 0;
if (c == 'C') return 1;
if (c == 'G') return 2;
return 3;
}
struct Trie {
struct Node {
Node* child[4];
int l, r;
Node() {
FOR(i, 0, 3) child[i] = 0;
l = INF;
r = 0;
}
};
Node* root;
Trie() {
root = new Node();
}
void add(const string &s, int idx) {
Node* p = root;
for (char c : s) {
int x = encode(c);
if (!p->child[x]) p->child[x] = new Node();
p = p->child[x];
p->l = min(p->l, idx);
p->r = max(p->r, idx);
}
}
pii get(const string &s) {
Node* p = root;
for (char c : s) {
int x = encode(c);
if (!p->child[x]) return {INF, INF};
p = p->child[x];
}
return {p->l, p->r};
}
};
struct RevTrie {
struct Node {
Node* child[4];
vector<int> id;
Node() {
FOR(i, 0, 3) child[i] = 0;
}
};
Node* root;
RevTrie() {
root = new Node();
}
void add(string s, int idx) {
reverse(ALL(s));
Node* p = root;
for (char c : s) {
int x = encode(c);
if (!p->child[x]) p->child[x] = new Node();
p = p->child[x];
p->id.pb(idx);
}
}
int get(const string &s, pii range) {
int l = range.fi, r = range.sc;
if (l == r && l == INF) return 0;
Node* p = root;
for (char c : s) {
int x = encode(c);
if (!p->child[x]) return 0;
p = p->child[x];
}
return upper_bound(ALL(p->id), r) - lower_bound(ALL(p->id), l);
}
};
void solve()
{
cin >> n >> q;
FOR(i, 1, n) cin >> a[i];
sort(a + 1, a + 1 + n);
Trie prefix;
RevTrie suffix;
FOR(i, 1, n) {
prefix.add(a[i], i);
suffix.add(a[i], i);
}
while (q--) {
string pre, suf;
cin >> pre >> suf;
reverse(ALL(suf));
cout << suffix.get(suf, prefix.get(pre)) << "\n";
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define NAME "main"
if (fopen(NAME".inp", "r")) {
freopen(NAME".inp", "r", stdin);
freopen(NAME".out", "w", stdout);
}
solve();
///cerr << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << "s";
return 0;
}
