#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=2e5+100;
bool bk[N],bz[N];
char s[2*N],ss[2*N];int a[N],b[N],Cnt[2][N],qz[2][N],g[2*N],nex[2*N];

int main()
{

    scanf("%s",s+1);
    int n=strlen(s+1);

    int m;scanf("%d",&m);
    for(int i=1;i<=m;i++){
        char op[4];
        scanf("%s",op+1);
        if(op[1]=='L') a[i]=1,scanf("%d",&b[i]);
        else if(op[1]=='R') a[i]=2,scanf("%d",&b[i]);
        else a[i]=3;
    }

    for(int i=1;i<=n;i++) s[i+n]=s[i];

    nex[1]=0;int K;
    for(int i=2;i<=2*n;i++){
        int t=nex[i-1];
        while(t&&s[t+1]!=s[i]) t=nex[t];
        if(s[t+1]!=s[i]) nex[i]=0;
        else nex[i]=t+1;
        if(nex[i]==n) {K=i-n;break;}
    }

    int mx=0,md=0;

    for(int i=1;i<=2*n;i++){
        if(i%2==1) ss[i]=s[i/2+1];
        else if(i<2*n) ss[i]='#';
    }

    for(int i=1;i<=2*n-1;i++){
        if(i<=mx){
            int t=2*md-i;
            g[i]=min(g[t],mx-i);
        }
        while(i+g[i]+1<=2*n-1&&ss[i+g[i]+1]==ss[i-g[i]-1]) g[i]++;
        if(mx<i+g[i]) mx=i+g[i];
    }

    for(int i=1;i<=2*n;i++){
        if(i-g[i]==1){
            int R=i+g[i];
            bk[R/2+1]=true;
        }
        if(i+g[i]==2*n-1){
            int L=i-g[i];
            bz[L/2]=true;
        }
    }

    // for(int i=1;i<=n;i++) printf("%d %d\n",bk[i],bz[i]);

    bz[n]=true;
    int las=-1,ww=-1;
    for(int i=1;i<=n;i++){
        if(bz[i]&&bk[i]){
            if(las==-1) las=i;
            else {ww=i-las;break;}
        }
    }

    Cnt[0][0]=qz[0][0]=1;
    int ty=0,Sum=0;ll Ans=0;

    for(int i=1;i<=m;i++){
        if(a[i]==3){
            ty^=1;
        }
        else if(a[i]==2){
            if(ty) Sum=(Sum+b[i])%n;
            else Sum=(Sum-b[i]+n)%n;
        }
        else{
            if(ty) Sum=(Sum-b[i]+n)%n;
            else Sum=(Sum+b[i])%n;
        }
        Ans=Ans+Cnt[ty][Sum%K];
        if(ww!=-1){
            Ans=Ans+qz[ty^1][Sum%ww];
            qz[ty][Sum%ww]++;
        }
        else if(las!=-1){
            if(ty) Ans=Ans+qz[ty^1][(Sum-las+n)%n];
            else Ans=Ans+qz[ty^1][(Sum+las)%n];
            qz[ty][Sum]++;
        }
        // printf("%d %d\n",ty,Sum);
        Cnt[ty][Sum%K]++;
    }

    printf("%lld\n",Ans);

    return 0;
}