#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


/*
  s, t: \Z/M\Z -> char
  s ~~> t
  t[i] = s[f[i]]
  t = s o f  (pullback)
  
  0 <= d < M
    d  : x -> (+x + d) mod M
    M+d: x -> (-x + d) mod M
*/
int M;
int mod(int d) {
  for (; d < 0; d += M) {}
  for (; d >= M; d -= M) {}
  return d;
}
// f o g
int mul(int f, int g) {
  return (((f >= M) != (g >= M)) ? M : 0) + mod(f + ((f >= M) ? -g : g));
}


int SLen;
char S[200'010];
int K;
vector<int> F;

int readFunc() {
  char op;
  scanf(" %c", &op);
  if (op == 'I') {
    return M + (M - 1);
  } else if (op == 'R') {
    int d;
    scanf("%d", &d);
    return d % M;
  } else if (op == 'L') {
    int d;
    scanf("%d", &d);
    return (SLen - d) % M;
  } else {
    assert(false);
  }
}

int main() {
  for (; ~scanf("%s", S); ) {
    SLen = strlen(S);
    
    vector<int> fail(SLen + 1);
    {
      int j = fail[0] = -1;
      for (int i = 0; i < SLen; ++i) {
        for (; ~j && S[j] != S[i]; j = fail[j]) {}
        fail[i + 1] = ++j;
      }
    }
    M = SLen - fail[SLen];
    if (SLen % M != 0) M = SLen;
cerr<<"M = "<<M<<endl;
    
    // S = S o tar
    int tar = -1;
    for (int i = 0, j = 0; i < 2 * M; ++i) {
      const char s = S[mod(-i)];
      for (; ~j && S[j] != s; j = fail[j]) {}
      if (++j == M) {
        // -i-1, -i-2, ..., -i+1, -i -> 0, 1, ..., M-2, M-1
cerr<<"tar = M + "<<mod(-i-1)<<endl;
        tar = M + mod(-i-1);
        break;
      }
    }
    
    scanf("%d", &K);
    F.resize(K);
    for (int k = 0; k < K; ++k) {
      F[k] = readFunc();
    }
    
    vector<int> FProd(K + 1);
    FProd[0] = 0;
    for (int k = 0; k < K; ++k) {
      FProd[k + 1] = mul(FProd[k], F[k]);
    }
// cerr<<"F = "<<F<<endl;
// cerr<<"FProd = "<<FProd<<endl;
    /*
      F[l] o ... o F[r-1] = (0 or tar)
      FProd[r] = FProd[l] o (0 or tar)
    */
    Int ans = 0;
    vector<int> freq(2 * M, 0);
    for (int k = K; k >= 0; --k) {
      const int f = FProd[k];
      ans += freq[f];
      if (~tar) {
        ans += freq[mul(f, tar)];
      }
      ++freq[f];
    }
    printf("%lld\n", ans);
  }
  return 0;
}