// #pragma GCC optimize("O3")
// #pragma GCC optimization("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define FOD(i, r, l) for (int i = (r); i >= (l); i--)
#define fi first
#define se second
#define pii pair<int, int>
const ll mod = 1e9 + 7;
const int MAXN = 1e5 + 5;
const ll oo = 1e18 + 7;
const int base = 31;
const int B = 200;
int n, q;
vector<int> h[MAXN];
int mu[MAXN];
int get(vector<int> &h, int l, int r){
return h[r]-h[l-1]*mu[r-l+1];
}
vector<pii> heavy;
map<pii, int> mp;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("test.txt", "r", stdin);
// freopen("o2.out", "w", stdout);
if(fopen(".inp", "r")){
freopen(".inp", "r", stdin);
freopen(".out", "w", stdout);
}
mu[0]=1;
FOR(i, 1, 1e5){
mu[i]=mu[i-1]*base;
}
cin >> n >> q;
FOR(i, 1, n){
string s;
cin >> s;
s="."+s;
h[i].resize((int)s.size());
FOR(j, 1, (int)s.size()-1){
h[i][j]=h[i][j-1]*base+(s[j]-'a'+1);
}
if((int)s.size()>B){
heavy.push_back({i, (int)s.size()-1});
}
else{
FOR(jj, 1, (int)s.size()-1){
FOR(j, 1, (int)s.size()-1){
int x=get(h[i], 1, jj);
int y=get(h[i], j, (int)s.size()-1);
mp[{x, y}]++;
}
}
}
}
while(q--){
string a, b;
cin >> a >> b;
int sum1=0;
for(auto x:a){
sum1=sum1*base+(x-'a'+1);
}
int sum2=0;
for(auto x:b){
sum2=sum2*base+(x-'a'+1);
}
int ans=0;
if(mp.find({sum1, sum2})!=mp.end()){
ans+=mp[{sum1, sum2}];
}
for(auto [i, sz]:heavy){
int x=get(h[i], 1, (int)a.size());
if(sum1!=x) continue;
int y=get(h[i], sz-(int)b.size()+1, sz);
if(sum2!=y) continue;
ans++;
}
cout << ans << '\n';
// cout << 1;
}
return 0;
}
