#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define FOR(i, a, b) for (int i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for (int i = a, _b = b; i >= _b; --i)
#define FORLL(i, a, b) for (ll i = a, _b = b; i <= _b; ++i)
#define FORDLL(i, a, b) for (ll i = a, _b = b; i >= _b; --i)
#define all(x) x.begin(), x.end()
#define uni(x) sort(all(x)), x.erase(unique(all(x)), x.end())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__)
template<typename T>
void __print_one(const char *&s, const T &x)
{
while (*s == ' ') ++s;
const char *p = s;
int bal = 0;
while (*s)
{
if (*s == '(') ++bal;
else if (*s == ')') --bal;
else if (*s == ',' && bal == 0) break;
++s;
}
cerr.write(p, s - p) << " = " << x;
if (*s == ',')
{
++s;
cerr << " , ";
}
}
template<typename... Args>
void debug(const char *s, Args... args)
{
cerr << "[ ";
int dummy[] = { 0 , ( __print_one(s, args) , 0 )... };
(void)dummy;
cerr << " ]\n\n";
}
template<class X>
bool maximize(X &a, X b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template<class X>
bool minimize(X &a, X b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
// --------------------------------------------------------------------------------------------
const int base = 5, mod[2] = {int(1e9) + 7, int(1e9) + 9};
int n, q;
string St[100005];
vector<ll> Hash[100005][2];
vector<ll> HashSuff[100005][2];
// --------------------------------------------------------------------------------------------
int get_type(char ch)
{
if (ch == 'A') return 0;
if (ch == 'U') return 1;
if (ch == 'G') return 2;
return 3;
}
char get_char(int type)
{
if (type == 0) return 'A';
if (type == 1) return 'U';
if (type == 2) return 'G';
return 'C';
}
namespace sub12
{
void solve()
{
FOR(i, 1, n)
{
St[i] = '#' + St[i];
FOR(j, 0, 1)
{
Hash[i][j].assign(int(St[i].size()) + 3, 0ll);
FOR(k, 1, int(St[i].size()) - 1)
Hash[i][j][k] = (1ll * Hash[i][j][k - 1] * base + get_type(St[i][k])) % mod[j];
HashSuff[i][j].assign(int(St[i].size()) + 3, 0ll);
FORD(k, int(St[i].size()) - 1, 1)
HashSuff[i][j][k] = (1ll * HashSuff[i][j][k + 1] * base + get_type(St[i][k])) % mod[j];
}
}
while (q--)
{
string P, S; cin >> P >> S;
ll HashP[2] = {0, 0}, HashS[2] = {0, 0};
for (const char &ch : P)
{
FOR(j, 0, 1)
{
HashP[j] = (1ll * HashP[j] * base + get_type(ch)) % mod[j];
}
}
FORD(i, int(S.size()) - 1, 0)
{
char &ch = S[i];
FOR(j, 0, 1)
{
HashS[j] = (1ll * HashS[j] * base + get_type(ch)) % mod[j];
}
}
int res = 0, szP = int(P.size()), szS = int(S.size());
FOR(i, 1, n)
{
if (P.size() > St[i].size()) continue;
if (S.size() > St[i].size()) continue;
int sz = int(St[i].size()) - 1;
if (Hash[i][0][szP] == HashP[0] && Hash[i][1][szP] == HashP[1])
if (HashSuff[i][0][sz - szS + 1] == HashS[0] && HashSuff[i][1][sz - szS + 1] == HashS[1])
++res;
}
cout << res << '\n';
}
}
}
void solve()
{
cin >> n >> q;
FOR(i, 1, n)
cin >> St[i];
sub12 :: solve();
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define TASK "TEST"
if (fopen(TASK".INP", "r"))
{
freopen(TASK".INP", "r", stdin);
freopen(TASK".OUT", "w", stdout);
}
solve();
return 0;
}
