#include<bits/stdc++.h>
using namespace std;
#define ri int
typedef long long ll;
const int maxn=1e6+10;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
template<class T>inline void clear(T *arr,int siz,int val=0){memset(arr,val,sizeof(T)*(siz+1));}
vector<int>a[maxn];
int ans[maxn][26],cnt,ed[maxn],f[maxn][26],id[maxn],len,n,pos[maxn],q,sum,trie[maxn][26];
string s,t[maxn];
void dfs(int p){
	sum+=ed[p];
	for(ri i=0;i<26;++i){
		ans[p][i]=sum;
		if(pos[p]==len-1)ans[p][i]-=ed[p];
		if(trie[p][i])dfs(trie[p][i]);
	}
	if(pos[p]>=len)return;
	for(ri i=0;i<26;++i)f[p][i]=(trie[p][i]?max(p,f[trie[p][i]][i]):p);
}
int main(){
	ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>q>>s;
    pos[0]=-1;
    for(ri i=1;i<=n;++i){
		cin>>t[i];
		ri cur=0,now=0;
		a[i].push_back(now);
		for(char ch:t[i]){
			ri &nxt=trie[now][ch-'a'];
			if(!nxt)nxt=++cnt;
			now=nxt;
			a[i].push_back(now),id[now]=i,pos[now]=cur++;
		}
		++ed[now];
	}
	len=s.size();
	dfs(0);
	ri now=0;
	for(char ch:s){
		ri nxt=trie[now][ch-'a'];
		if(!nxt)break;
		now=nxt;
	}
	char mx=(pos[now]==len-1?'a':s[pos[now]+1]);
	cout<<ans[now][mx-'a']<<endl;
	while(q--){
		ri k;
		char c;
		cin>>k>>c;
		if(pos[now]+2>=k){
			if(pos[now]+2>k)now=a[id[now]][k-1];
			now=f[now][c-'a'],mx=(pos[now]==len-1?'a':c);
		}
		cout<<ans[now][mx-'a']<<endl;
	}
	return 0;
}