//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
string s;
int n,m;
int d;
struct tag
{
	int r;
	int s;
	tag(){};
	tag(int _r,int _s):r(_r),s(_s){}
};
tag merge(tag a,tag b)
{
	return tag(a.r^b.r,(b.s+(b.r?d-a.s:a.s))%d);
}
tag A[200200],B[200200];
int type[200200],val[200200];
mt19937 rnd(20210448);
const ll mod=998244353,base=12345+rnd();
ll H1[400400],H2[400400];
ll pw;
ll get1(int l,int r)
{
	return (H1[r]-H1[l-1]*pw%mod+mod)%mod;
}
ll get2(int l,int r)
{
	return (H2[r]-H2[l-1]*pw%mod+mod)%mod;
}
ll cnt1[200200],cnt2[200200];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>s;
	n=sz(s);
	string s2=s;
	for(int i=1;i<n;i++)
		if(i<n-i)
			swap(s2[i],s2[n-i]);
	cin>>m;
	for(int i=1;i<=n;i++)
		if(n%i==0)
		{
			bool flag=1;
			for(int j=0;j<n;j++)
				if(s[j]!=s[(j+i)%n])
				{
					flag=0;
					break;
				}
			if(flag)
			{
				d=i;
				break;
			}
		}
	s+=s;
	s2+=s2;
	for(int i=0;i<n+n;i++)
		H1[i+1]=(H1[i]*base+s[i])%mod;
	for(int i=0;i<n+n;i++)
		H2[i+1]=(H2[i]*base+s2[i])%mod;
	pw=1;
	int pos=-1;
	for(int i=0;i<d;i++)
		if(get1(i+1,i+n)==get2(1,n))
			pos=i;
	for(int i=1;i<=n;i++)
		pw=pw*base%mod;
	A[0]=tag(0,0);
	for(int i=1;i<=m;i++)
	{
		char ch;
		cin>>ch;
		if(ch=='R')
		{
			type[i]=1;
			cin>>val[i];
			val[i]%=d;
		}
		else if(ch=='L')
		{
			type[i]=1;
			cin>>val[i];
			val[i]=(d-val[i]%d)%d;
		}
	}
	for(int i=1;i<=m;i++)
		if(type[i])
			A[i]=merge(A[i-1],tag(0,val[i]));
		else
			A[i]=merge(A[i-1],tag(1,d-1));
	for(int i=1;i<=m;i++)
		if(type[i])
			B[i]=merge(tag(0,(d-val[i])%d),B[i-1]);
		else
			B[i]=merge(tag(1,d-1),B[i-1]);
	ll ans=0;
	for(int i=1;i<=m;i++)
	{
		if(B[i-1].r)
			cnt2[B[i-1].s]++;
		else
			cnt1[B[i-1].s]++;
		if(A[i].r)
		{
			ans+=cnt2[A[i].s];
			if(pos!=-1)
				ans+=cnt1[(A[i].s-pos+d)%d];
		}
		else
		{
			ans+=cnt1[(d-A[i].s)%d];
			if(pos!=-1)
				ans+=cnt2[(pos-A[i].s+d)%d];
		}
	}
	cout<<ans<<endl;
	return 0;
}