// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
vector<int> ps = {5791, 8237, 3067, 6991, 3527};
vector<int> mods = {791139137, 433567597, 271149607, 561259969, 222708581};
ll pows[N][2];
void precalc() {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
shuffle(all(ps), rng);
shuffle(all(mods), rng);
rep(j, 2) {
pows[0][j] = 1;
rep1(i, N - 1) {
pows[i][j] = pows[i - 1][j] * ps[j] % mods[j];
}
}
}
struct Hash {
ll a[2];
Hash() {
memset(a, 0, sizeof a);
}
Hash(ll x, ll y) {
a[0] = x, a[1] = y;
}
Hash operator+(char ch) {
Hash b;
ll x = ch - 'A' + 1;
rep(j, 2) {
b.a[j] = (a[j] * ps[j] + x) % mods[j];
}
return b;
}
Hash operator-(Hash h) {
Hash b;
rep(j, 2) {
b.a[j] = (a[j] - h.a[j] + mods[j]) % mods[j];
}
return b;
}
Hash poww(ll k) {
Hash b;
rep(j, 2) {
b.a[j] = a[j] * pows[k][j] % mods[j];
}
return b;
}
bool operator==(Hash h) {
rep(j, 2) {
if (a[j] != h.a[j]) {
return false;
}
}
return true;
}
bool operator<(const Hash &h) const {
rep(j, 2) {
if (a[j] != h.a[j]) {
return a[j] < h.a[j];
}
}
return false;
}
};
void solve(int test_case)
{
precalc();
ll n, m; cin >> n >> m;
vector<vector<Hash>> pref_hashes(n), suff_hashes(n);
rep(i, n) {
string s; cin >> s;
Hash hsh;
rep(j, sz(s)) {
hsh = hsh + s[j];
pref_hashes[i].pb(hsh);
}
hsh = Hash();
rev(j, sz(s) - 1, 0) {
hsh = hsh + s[j];
suff_hashes[i].pb(hsh);
}
}
while (m--) {
string p, q; cin >> p >> q;
ll siz1 = sz(p), siz2 = sz(q);
reverse(all(q));
Hash hsh1, hsh2;
trav(ch, p) hsh1 = hsh1 + ch;
trav(ch, q) hsh2 = hsh2 + ch;
ll ans = 0;
rep(i, n) {
ll siz = sz(pref_hashes[i]);
if (siz < max(siz1, siz2)) conts;
if (hsh1 == pref_hashes[i][siz1 - 1] and hsh2 == suff_hashes[i][siz2 - 1]) {
ans++;
}
}
cout << ans << endl;
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
