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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;

typedef pair<int, bool> pib;

int N, M, T, K;
char S[MAXN+10], S2[MAXN+10];
pib A[MAXN+10], B[MAXN+10];

int mmod(int x, int N) { return (x%N+N)%N; }
pib operator + (pib a, pib b) { return pib{mmod(a.first+(a.second ? -1 : 1)*b.first, N), a.second^b.second}; }

int F[MAXN+10];
void getFail()
{
    F[0]=-1;
    for(int i=1; i<=N; i++)
    {
        int j=F[i-1];
        while(j>=0 && S[j+1]!=S[i]) j=F[j];
        F[i]=j+1;
    }
}

int P[MAXN*2+10];
void getManacher(int N)
{
    int pos=0;
    for(int i=1; i<=N; i++)
    {
        if(i<=pos+P[pos]) P[i]=min(pos+P[pos]-i, P[pos+pos-i]);
        while(i+P[i]+1<=N && i-P[i]-1>=1 && S2[i-P[i]-1]==S2[i+P[i]+1]) P[i]++;
        if(P[pos]+pos<P[i]+i) pos=i;
    }
}
bool ispal(int l, int r)
{
    if(l>r) return true;
    l=l*2-1; r=r*2-1;
    int t=l+r>>1;
    if(t-P[t]<=l && r<=t+P[t]) return true;
    return false;
}

int cnt[MAXN+10][2];

int main()
{
    scanf("%s", S+1); N=strlen(S+1);
    scanf("%d", &M);
    for(int i=1; i<=M; i++)
    {
        char c; int p;
        scanf(" %c", &c);
        if(c=='R')
        {
            scanf("%d", &p);
            A[i]=A[i-1]+pib{mmod(-p, N), 0};
        }
        else if(c=='L')
        {
            scanf("%d", &p);
            A[i]=A[i-1]+pib{mmod(p, N), 0};
        }
        else
        {
            A[i]=A[i-1]+pib{0, 1};
        }
        if(!A[i].second) B[i]=pib{mmod(-A[i].first, N), 0};
        else B[i]=A[i];
    }

    getFail();
    T=N;
    for(int i=F[N]; i>0; i=F[i])
    {
        if(N%(N-i)==0)
        {
            T=N-i;
            break;
        }
    }

    for(int i=1; i<=N+N-1; i++)
    {
        if(i%2) S2[i]=S[i/2+1];
        else S2[i]='?';
    }
    getManacher(N+N-1);

    K=-1;
    for(int i=0; i<T; i++)
    {
        if(ispal(1, i) && ispal(i+1, T)) K=i;
    }

    ll ans=0;
    for(int i=1; i<=M; i++)
    {
        cnt[mmod(B[i-1].first, T)][B[i-1].second]++;

        if(!A[i].second)
        {
            ans+=cnt[mmod(-A[i].first, T)][0];
            if(K!=-1) ans+=cnt[mmod(A[i].first+K, T)][1];
        }
        else
        {
            if(K!=-1) ans+=cnt[mmod(K-A[i].first, T)][0];
            ans+=cnt[mmod(A[i].first, T)][1];
        }
    }
    printf("%lld\n", ans);
}