#include <bits/stdc++.h>
using namespace std;
#define M 200005
char S[M];
int q,n,P;
struct Node{
    int k,flg;
    Node(){}
    Node(int a,int b):k(a),flg(b){}
    Node Add(int kx){
        return Node((k+kx)%P,flg);
    }
    Node rev(){
        return Node((n-k)%P,!flg);
    }
    bool operator < (const Node &res)const{
        return k<res.k || k == res.k && flg < res.flg;
    }
    void print(){
        cout<<flg<<' '<<k<<endl;
    }
}A[M];
int Ask_per(){
    static int f[M];
    f[1]=0;
    for(int i=2,j=0;i<=n;i++){
        while(j && S[j+1]!=S[i])j=f[j];
        if(S[j+1]==S[i])j++;
        f[i]=j;
    }
    if(n%(n-f[n]) == 0)return n-f[n];
    else return n;
}
using ull = unsigned long long;
int Ask_K(){
    const int BS=37;
    ull pw = 1;
    for(int i=1;i<=n;i++)pw *= BS;
    ull bs = 0;
    for(int i=1;i<=n;i++)bs = BS*bs+S[i]-'a'+1;
    reverse(S+1,S+1+n);
    ull now = 0;
    for(int i=1;i<=n;i++)now = BS*now+S[i]-'a'+1;
    if(now == bs)return 0;
    for(int i=1;i<=n;i++){
        now *= BS;
        now -= pw * (S[i]-'a'+1);
        now += S[i]-'a'+1;
        if(now == bs)return i;
    }
    return -1;
}
using ll = long long;
int main(){
    scanf("%s",S+1);
    n=strlen(S+1);
    cin>>q;
    P = Ask_per();
    Node t = Node(0,0);
    for(int i=1;i<=q;i++){
        char op[5];
        int k;
        scanf("%s",op);
        if(op[0]!='I')scanf("%d",&k);
        if(op[0] == 'L')t = t.Add(k);
        else if(op[0] == 'R')t = t.Add(n-k);
        else t = t.rev();
        A[i] = t;
        // t.print();
    }
    int K = Ask_K();
    map<Node,int>cnt;
    cnt[Node(0,0)]++;
    ll ans = 0;
    for(int i=1;i<=q;i++){
        if(A[i].flg){
            ans += cnt[Node(A[i].k,1)];
            if(K!=-1)ans += cnt[Node((P-A[i].k+K)%P,0)];
        }else{
            ans += cnt[Node(A[i].k,0)];
            if(K!=-1)ans += cnt[Node((P-A[i].k+K)%P,1)];
        }
        cnt[A[i]]++;
        // cout<<ans<<endl;
    }
    cout<<ans<<endl;
    return 0;
}