// #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 = 1e6 + 5;
const ll oo = 1e18 + 7;
const int base = 10;
int n, q;
string a[MAXN];
struct query{
string a, b;
int id;
}tv[MAXN];
bool cmp(query a, query b){
return a.a<b.a;
}
int res[MAXN];
int child[MAXN][30], dm;
vector<int> cnt[MAXN];
void add(string &s, int id){
int u=0;
FOD(i, (int)s.size()-1, 0){
int k=s[i]-'A'+1;
if(!child[u][k]){
child[u][k]=++dm;
}
u=child[u][k];
cnt[u].push_back(id);
}
}
int get(string &s, int id){
int u=0;
FOD(i, (int)s.size()-1, 0){
int k=s[i]-'A'+1;
if(!child[u][k]){
return 0;
}
u=child[u][k];
}
int it=lower_bound(cnt[u].begin(), cnt[u].end(), id)-cnt[u].begin()+1;
return (int)cnt[u].size()-it+1;
}
bool check(string &a, string &b){
if((int)a.size()<(int)b.size()) return 0;
FOR(i, 0, (int)b.size()-1){
if(b[i]!=a[i]){
return 0;
}
}
return 1;
}
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);
}
cin >> n >> q;
FOR(i, 1, n){
cin >> a[i];
}
FOR(i, 1, q){
cin >> tv[i].a >> tv[i].b;
tv[i].id=i;
}
sort(a+1, a+1+n);
sort(tv+1, tv+1+q, cmp);
int j=1;
FOR(i, 1, q){
auto [s, ss, id]=tv[i];
while(j<=n && check(a[j], s)){
add(a[j], j);
j++;
}
if(!check(a[j-1], s)){
res[id]=0;
continue;
}
int l=1, r=j-1, pos=j;
while(l<=r){
int mid=(l+r)/2;
if(check(a[mid], s)){
pos=mid;
r=mid-1;
}
else{
l=mid+1;
}
}
res[id]=get(ss, pos);
}
FOR(i, 1, q){
cout << res[i] << '\n';
}
return 0;
}
