#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=2e5+5,MOD=1e9+21;
mt19937 rnd(time(0));
int bs,pw[MAXN],hc[MAXN],phs[MAXN];
char s[MAXN];
int qhs(int l,int r) { return (phs[r]+1ll*(MOD-pw[r-l+1])*phs[l-1])%MOD; }
int n,m;
struct String {
	vector <int> L,R,hv;
	vector <ll> siz;
	ll len;
	void read() {
		int k; cin>>k;
		L.resize(k),R.resize(k);
		for(int i=0;i<k;++i) cin>>L[i]>>R[i];
	}
	void rev() {
		swap(L,R);
		for(int &i:L) i=2*n+1-i;
		for(int &i:R) i=2*n+1-i;
		reverse(L.begin(),L.end());
		reverse(R.begin(),R.end());
	}
	void init() {
		int k=L.size(); len=0;
		hv.resize(k),siz.resize(k);
		for(int i=0;i<k;++i) {
			len+=R[i]-L[i]+1,siz[i]=len;
			hv[i]=(1ll*(i?hv[i-1]:0)*pw[R[i]-L[i]+1]+qhs(L[i],R[i]))%MOD;
		}
	}
	inline int qhv(ll x) const {
		int i=lower_bound(siz.begin(),siz.end(),x)-siz.begin();
		if(!i) return qhs(L[i],L[i]+x-1);
		x-=siz[i-1];
		return (1ll*hv[i-1]*pw[x]+qhs(L[i],L[i]+x-1))%MOD;
	}
	inline char qc(ll x) const {
		int i=lower_bound(siz.begin(),siz.end(),x)-siz.begin();
		x-=i?siz[i-1]:0;
		return s[L[i]+x-1];
	}
};
ll lcp(const String &u,const String &v) {
	ll l=1,r=min(u.len,v.len),x=0;
	while(l<=r) {
		ll mid=(l+r)>>1;
		if(u.qhv(mid)==v.qhv(mid)) x=mid,l=mid+1;
		else r=mid-1;
	}
	return x;
}
char op[MAXN];
int del[MAXN],id[MAXN];
void build(String *S,int *st,int *ed) {
	int q=0;
	for(int i=1;i<=m;++i) if(op[i]!='-') id[++q]=i;
	sort(id+1,id+q+1,[&](int x,int y){
		ll k=lcp(S[x],S[y]);
		if(k==min(S[x].len,S[y].len)) {
			if(S[x].len^S[y].len) return S[x].len<S[y].len;
			return op[x]=='?'&&op[y]=='+';
		}
		return S[x].qc(k+1)<S[y].qc(k+1);
	});
	for(int i=1;i<=q;++i) {
		st[id[i]]=i;
		const String &str=S[id[i]];
		int l=i+1,r=q,k=i,e=str.len,t=str.hv.back();
		while(l<=r) {
			int mid=(l+r)>>1;
			auto chk=[&](const String &v) {
				return v.len>=e&&v.qhv(e)==t;
			};
			if(chk(S[id[mid]])) k=mid,l=mid+1;
			else r=mid-1;
		}
		ed[id[i]]=k;
	}
}
String A[MAXN],B[MAXN];
int st1[MAXN],ed1[MAXN],st2[MAXN],ed2[MAXN];
struct opr { int x,l,r,id,k; } a[MAXN*2];
int ans[MAXN];
struct FenwickTree {
	int tr[MAXN],st[MAXN],tp,s;
	void add(int x,int v) { for(st[++tp]=x;x<=m;x+=x&-x) tr[x]+=v; }
	int qry(int x) { for(s=0;x;x&=x-1) s+=tr[x]; return s; }
	void init() { while(tp) for(int x=st[tp--];x<=m;x+=x&-x) tr[x]=0; }
}	T;
void cdq(int l,int r) {
	if(l==r) return ;
	int mid=(l+r)>>1;
	cdq(l,mid),cdq(mid+1,r);
	T.init();
	for(int i=mid+1,j=l;i<=r;++i) {
		for(;j<=mid&&a[j].x<=a[i].x;++j) if(!a[j].id) T.add(a[j].l,a[j].k);
		if(a[i].id) ans[a[i].id]+=a[i].k*(T.qry(a[i].r)-T.qry(a[i].l-1));
	}
	inplace_merge(a+l,a+mid+1,a+r+1,[&](auto i,auto j){ return i.x<j.x; });
}
signed main() {
	bs=rnd()%MOD,pw[0]=1;
	for(int i=1;i<MAXN;++i) pw[i]=1ll*pw[i-1]*bs%MOD;
	for(int c=0;c<26;++c) hc[c]=rnd()%MOD;
	ios::sync_with_stdio(false);
	cin>>n>>m>>(s+1);
	for(int i=1;i<=n;++i) s[2*n+1-i]=s[i];
	for(int i=1;i<=2*n;++i) phs[i]=(1ll*phs[i-1]*bs+hc[s[i]-'a'])%MOD;
	for(int i=1;i<=m;++i) {
		cin>>op[i];
		if(op[i]=='-') cin>>del[i];
		else if(op[i]=='?') {
			A[i].read(),B[i].read(),B[i].rev();
			A[i].init(),B[i].init();
		} else {
			A[i].read(),B[i]=A[i],B[i].rev();
			A[i].init(),B[i].init();
		}
	}
	build(A,st1,ed1),build(B,st2,ed2);
	int q=0;
	for(int i=1;i<=m;++i) {
		if(op[i]=='?') {
			a[++q]={st1[i]-1,st2[i],ed2[i],i,-1};
			a[++q]={ed1[i],st2[i],ed2[i],i,1};
		} else {
			int x=(op[i]=='-')?del[i]:i;
			a[++q]={st1[x],st2[x],0,0,op[i]=='-'?-1:1};
		}
	}
	cdq(1,q);
	for(int i=1;i<=m;++i) if(op[i]=='?') cout<<ans[i]<<"\n";
	return 0;
}