#include<iostream>
#include<cstring>
#include<cassert>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<bitset>
#include<time.h>
#include<algorithm>
using namespace std;
#define REP(i,x,y) for(int i=x;i<=y;i++)
#define rep(i,n) REP(i,1,n)
#define rep0(i,n) REP(i,0,n-1)
#define repG(i,x) for(int i=pos[x];~i;i=e[i].next)
#define ll long long
#define db double
const int N=1e6+7;
const int INF=1e9+7;
void read(int &x){
	char c=getchar(); x=0;
	while(c<'0'||c>'9')c=getchar();
	while(c<='9'&&c>='0')x=x*10+c-'0',c=getchar();
}
int fa[N][22],dep[N],pos[N],dw[N][26],w[N],vl[N][26],v0[N];
struct edge{int v,c,next;}e[N*2];
int n,m,num=0,q,cnt=1,tp;
void add(int x,int y,int c){e[num]=(edge){y,c,pos[x]}; pos[x]=num++;}
char s[N],t[N];
int ex(int x,int y){
	repG(i,x)if(e[i].c==y)return e[i].v;
	add(x,++cnt,y);
	return cnt;
}
void dfs(int x,int f,int d,int vv){
	dep[x]=d;
	fa[x][0]=f;
	for(int j=0;fa[fa[x][j]][j];j++)fa[x][j+1]=fa[fa[x][j]][j];
	v0[x]=vv;
	vv+=w[x];
	rep0(i,26){
		int id=0;
		repG(j,x){
			if(e[j].c==i){
				id=e[j].v;
				break;
			}
		}
		if(id){
			dfs(id,x,d+1,vv);
			vv+=w[id];
			w[x]+=w[id];
			dw[x][i]=dw[id][i];
		}
		else{
			dw[x][i]=x;
			vl[x][i]=vv;
		}
	}
}
struct pir{int l,c;}st[N];
void pt(int x){
	if(dep[x]==m){
		printf("%d\n",v0[x]);
		return;
	}
	int l=1,r=tp;
	while(l<r-1){
		int mid=(l+r)>>1;
		if(st[mid].l<=dep[x]+1)l=mid;
		else r=mid;
	}
	if(st[r].l<=dep[x]+1){
		printf("%d\n",vl[x][st[r].c]);
		return;
	}
	printf("%d\n",vl[x][st[l].c]);
}
int main(){
	read(n);
	read(q);
	scanf("%s",s+1);
	m=strlen(s+1);
	memset(pos,-1,sizeof(pos));
	rep(i,n){
		scanf("%s",t+1);
		int ln=strlen(t+1),nw=1;
		rep(j,min(ln,m))nw=ex(nw,t[j]-'a');
		w[nw]++;
	}
	dfs(1,0,0,0);
	tp=m;
	int id=1;
	rep(i,m)st[i]=(pir){i,s[i]-'a'};
	rep(i,m){
		bool fl=1;
		repG(j,id){
			if(e[j].c==s[i]-'a'){
				fl=0;
				id=e[j].v;
				break;
			}
		}
		if(fl)break;
	}
	pt(id);
	dep[0]=-1;
	rep(i,q){
		int x,y; read(x);
		scanf("%s",t);
		y=t[0]-'a';
		if(dep[id]>=x-1){
			for(int j=20;~j;j--)if(dep[fa[id][j]]>=x-1)id=fa[id][j];
			id=dw[id][y];
		}
		while(tp&&st[tp].l>=x)tp--;
		st[++tp]=(pir){x,y};
		pt(id);
	}
	return 0;
}