#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ll long long
#define int long long
using namespace std;
//using namespace __gnu_pbds;

const int maxn = 810000;
const double pi = acos(-1);

struct E
{
	double x,y;
	friend inline E operator +(const E &k1,const E &k2){ return (E){k1.x+k2.x,k1.y+k2.y}; }
	friend inline E operator -(const E &k1,const E &k2){ return (E){k1.x-k2.x,k1.y-k2.y}; }
	friend inline E operator *(const E &k1,const E &k2){ return (E){k1.x*k2.x-k1.y*k2.y, k1.x*k2.y+k1.y*k2.x}; }
};
namespace FFT
{
	int id[maxn],N,ln;
	void DFT(E f[],const int sig)
	{
		for(int i=1;i<N;i++) if(i<id[i]) swap(f[i],f[id[i]]);
		
		for(int m=2;m<=N;m<<=1)
		{
			int t=m>>1;
			E wn = (E){cos(2*pi/m),sin(2*pi*sig/m)};
			for(int j=0;j<N;j+=m)
			{
				E w = (E){1,0};
				for(int i=0;i<t;i++)
				{
					E tx= f[j+i], ty= f[j+i+t]*w;
					f[j+i]=tx+ty;
					f[j+i+t]=tx-ty;
					w=w*wn;
				}
			}
		}
		if(sig==-1)
		{
			for(int i=0;i<N;i++) f[i].x/=N;
		}
	}
	void pre(int n)
	{
		N=1,ln=0;
		while(N<=n) N<<=1,ln++;
		for(int i=1;i<N;i++) id[i]= id[i>>1]>>1|(i&1)<<(ln-1);
	}
}
E Pos[maxn],Posr[maxn],Neg[maxn],Negr[maxn],Res[maxn];

string str;
int S[maxn],n,m;

int f[maxn],match[maxn];
int ai[maxn];

int suma[maxn],sig[maxn];

signed main()
{
	/////////////////////////////////////////////////
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	//mt19937 mt( (unsigned long long)(new char) );
	
	cin>>str; n=str.size();
	for(int i=1;i<=n;i++) S[i]= str[i-1]-'a'+1;
	for(int i=n+1;i<=n+n;i++) S[i]=S[i-n];
	for(int i=2*n+1;i<=3*n;i++) S[i]=S[3*n-i+1];
	for(int i=3*n+1;i<=4*n;i++) S[i]=S[i-n];
	
	for(int i=2,k=0;i<=n;i++)
	{
		while(k && S[k+1]!=S[i]) k=f[k];
		if(S[k+1]==S[i]) k++;
		f[i]=k;
	}
	for(int i=1,k=0;i<=4*n;i++)
	{
		while(k && S[i]!=S[k+1]) k=f[k];
		if(S[k+1]==S[i]) k++;
		if(k==n) 
		{
			k=f[k];
			match[i-n+1]=1;
		}
	}
	
	sig[0]=1; suma[0]=0;
	cin>>m;
	for(int i=1;i<=m;i++)
	{
		sig[i]=sig[i-1];
		suma[i]=suma[i-1];
		
		string ss; cin>>ss;
		if(ss[0]=='I') ai[i]=0,sig[i]*=-1;
		else
		{
			int cc; cin>>cc;
			if(ss[0]=='R') ai[i]=cc;
			else ai[i]=-cc;
			
		}
		suma[i]+=ai[i]*sig[i];
	}
	
	ll ans=-m-1;
	for(int i=0;i<=m;i++)
	{
		if(sig[i]==1)
		{
			int cc= (suma[i]%n+n)%n;
			Pos[cc].x+=1;
			Posr[(n-cc)%n].x+=1;
		}
		else
		{
			int cc= (suma[i]%n+n)%n;
			Neg[cc].x+=1;
			Negr[(n-cc)%n].x+=1;
		}
	}
	
	FFT::pre(2*n);
	FFT::DFT(Pos,1);
	FFT::DFT(Posr,1);
	FFT::DFT(Neg,1);
	FFT::DFT(Negr,1);
	
	//cerr<<ans<<endl;
	//+   +f
	for(int i=0;i<FFT::N;i++) Res[i]= Pos[i]*Posr[i];
	FFT::DFT(Res,-1);
	for(int i=0;i<2*n;i++)
	{
		int cc=(Res[i].x+0.5);
		int j= i%n;
		if(match[1+j]) ans+= cc;
	}
//	cerr<<ans<<endl;
	//-   -
	for(int i=0;i<FFT::N;i++) Res[i]= Neg[i]*Negr[i];
	FFT::DFT(Res,-1);
	for(int i=0;i<2*n;i++)
	{
		int cc=(Res[i].x+0.5);
		int j= (n-i+n)%n;
		if(match[1+j]) ans+= cc;
	}
//	cerr<<ans<<endl;
	ans/=2;
	//+   -
	for(int i=0;i<FFT::N;i++) Res[i]= Pos[i]*Negr[i];
	FFT::DFT(Res,-1);
	for(int i=0;i<2*n;i++)
	{
		int cc=(Res[i].x+0.5);
		int j= (n-i+n)%n;
		if(match[2*n+1+j]) ans+= cc;
	}
	//cerr<<ans<<endl;
	
	cout<<ans<<endl;
	
	return 0;
}