#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;
typedef long long ll;
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
#define N 100010
string s[N],p[N],q[N];
ll a[N],b[N],c[N],d[N];
ll ys[N];
int main(){
int n,m;
cin>>n>>m;
if(n>5000)return 0;
vector<pair<string,int> >v;
rep(i,n){
cin>>s[i];
}
rep(i,m)cin>>p[i]>>q[i];
sort(s,s+n);
rep(i,m){
a[i]=lower_bound(s,s+n,p[i])-s;
p[i][p[i].size()-1]++;
b[i]=lower_bound(s,s+n,p[i])-s;
}
rep(i,n){
rep(j,s[i].size()/2)swap(s[i][j],s[i][s[i].size()-1-j]);
v.push_back(make_pair(s[i],i));
}
sort(v.begin(),v.end());
rep(i,n)ys[v[i].second]=i;
rep(i,n)s[i]=v[i].first;
rep(i,m){
rep(j,q[i].size()/2)swap(q[i][j],q[i][q[i].size()-1-j]);
c[i]=lower_bound(s,s+n,q[i])-s;
q[i][q[i].size()-1]++;
d[i]=lower_bound(s,s+n,q[i])-s;
}
/*cout<<"dw"<<endl;
rep(i,n)cout<<i<<":"<<ys[i]<<endl;
cout<<"---"<<endl;
rep(i,n)cout<<a[i]<<" "<<b[i]<<" "<<c[i]<<" "<<d[i]<<endl;*/
rep(i,m){
ll ans=0;
for(int j=a[i];j<b[i];j++){
ans+=(c[i]<=ys[j]&&ys[j]<d[i]);
}
cout<<ans<<endl;
}
}
