#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod1=1030000001,mod2=1031000023,MAX=300005,INF=1<<30;

struct Rollinghash{
    string S;
    int n;
    int base1;
    int base2;
    vector<ll> h1,h2,ru1,ru2;
    
    void make(string &T,int ba1,int ba2){
        S=T;
        n=S.size();
        h1.assign(n+1,0);
        h2.assign(n+1,0);
        ru1.assign(n+1,0);
        ru2.assign(n+1,0);
        base1=ba1;
        base2=ba2;
        
        ru1[0]=1;
        ru2[0]=1;
        
        for(int i=1;i<=n;i++){
            h1[i]=h1[i-1]*base1+ll(S[i-1]-'a'+1);
            h1[i]%=mod1;
            
            h2[i]=h2[i-1]*base2+ll(S[i-1]-'a'+1);
            h2[i]%=mod2;
            
            ru1[i]=ru1[i-1]*base1%mod1;
            ru2[i]=ru2[i-1]*base2%mod2;
        }
    }
    
    pair<ll,ll> ha(int l,int r){
        pair<ll,ll> res;
        res.fi=(h1[r]-h1[l]*ru1[r-l]%mod1+mod1)%mod1;
        res.se=(h2[r]-h2[l]*ru2[r-l]%mod2+mod2)%mod2;
        
        return res;
    }//開区間
};

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    
    string S;cin>>S;
    ll ha1=rng()%mod1,ha2=rng()%mod2;
    ll N=si(S);
    ll Q;cin>>Q;
    
    vector<pair<ll,ll>> T(Q+1);
    for(int i=0;i<Q;i++){
        char c;cin>>c;
        T[i+1]=T[i];
        if(c=='I'){
            T[i+1].fi^=1;
        }else if(c=='L'){
            int x;cin>>x;
            if(T[i].fi==0){
                T[i+1].se=(T[i+1].se+x)%N;
            }else{
                T[i+1].se=(N+T[i+1].se-x)%N;
            }
        }else{
            int x;cin>>x;x=N-x;
            if(T[i].fi==0){
                T[i+1].se=(T[i+1].se+x)%N;
            }else{
                T[i+1].se=(N+T[i+1].se-x)%N;
            }
        }
        
        //cout<<T[i+1].fi<<" "<<T[i+1].se<<endl;
    }
    
    string A=S+S+S,B=A;
    reverse(all(B));
    
    Rollinghash ro1,ro2;
    ro1.make(A,ha1,ha2);
    ro2.make(B,ha1,ha2);
    //cout<<A<<endl;
    //cout<<B<<endl;
    //for(int i=0;i<N;i++) cout<<ro1.ha(i,i+N).fi<<" "<<ro2.ha(i,i+N).fi<<endl;
    
    ll ans=0;
    
    vector<ll> X,Y;
    for(auto [a,b]:T){
        if(a==0) X.push_back(b);
        else Y.push_back(b);
    }
    
    {
        vector<int> OK;
        for(int i=0;i<N;i++){
            if(ro1.ha(0,N)==ro1.ha(i,i+N)) OK.push_back(i);
        }
        ll g;
        if(si(OK)==1) g=N;
        else g=OK[1]-OK[0];
        vector<ll> CN(g);
        
        for(ll x:X){
            ans+=CN[x%g];
            CN[x%g]++;
            //cout<<x<<" ";
        }
    }
    
    {
        vector<int> OK;
        for(int i=0;i<N;i++){
            if(ro2.ha(0,N)==ro2.ha(i,i+N)) OK.push_back(i);
        }
        ll g;
        if(si(OK)==1) g=N;
        else g=OK[1]-OK[0];
        vector<ll> CN(g);
        
        for(ll x:Y){
            ans+=CN[x%g];
            CN[x%g]++;
            //cout<<x<<" ";
        }
    }
    
    {
        vector<int> OK;
        for(int i=0;i<N;i++){
            if(ro1.ha(0,N)==ro2.ha(N-i,N+N-i)) OK.push_back(i);
            //cout<<ro1.ha(0,N).fi<<" "<<ro1.ha(0,N).se<<endl;
            //cout<<ro2.ha(N-i,N+N-i).fi<<" "<<ro2.ha(N-i,N+N-i).se<<endl;
        }
        //cout<<si(OK)<<endl;
        if(si(OK)){
            ll g,dif;
            if(si(OK)==1){
                g=N;
                dif=OK[0];
            }else{
                g=(OK[1]-OK[0]);
                dif=OK[0]%g;
            }
            
            vector<ll> CN(g);
            
            for(auto [a,b]:T){
                if(a==0){
                    CN[(g-b%g+dif)%g]++;
                }else{
                    ans+=CN[b%g];
                }
            }
        }
    }
    
    {
        vector<int> OK;
        for(int i=0;i<N;i++){
            if(ro1.ha(0,N)==ro2.ha(N+i,N+N+i)) OK.push_back(i);
            //cout<<ro1.ha(0,N).fi<<" "<<ro1.ha(0,N).se<<endl;
            //cout<<ro2.ha(N-i,N+N-i).fi<<" "<<ro2.ha(N-i,N+N-i).se<<endl;
        }
        //cout<<si(OK)<<endl;
        if(si(OK)){
            ll g,dif;
            if(si(OK)==1){
                g=N;
                dif=OK[0];
            }else{
                g=(OK[1]-OK[0]);
                dif=OK[0]%g;
            }
            
            vector<ll> CN(g);
            
            for(auto [a,b]:T){
                if(a==1){
                    CN[(g-b%g+dif)%g]++;
                }else{
                    ans+=CN[b%g];
                }
            }
        }
    }
    
    cout<<ans<<endl;
}