#include <bits/stdc++.h>
using namespace std;
#define all(arr) (arr).begin(), (arr).end()
#define ll long long
#define ld long double
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define endl '\n'

vector<int> z_function(string s){
  int n = sz(s);
  vector<int> z(n);
  int l = 0, r = 0;
  for (int i = 1; i < n; i++){
    if (i < r) z[i] = min(z[i - l], r - i);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) z[i]++;
    if (i + z[i] > r) l = i, r = i + z[i];
  }
  return z;
}

int nextocc(string s, string t, int start_idx){
  auto z = z_function(s + t);
  for (int i = sz(s) + start_idx; i < sz(z); i++){
    if (z[i] >= sz(s)) return i - sz(s);
  }
  return sz(t);
}

const int N = 2e5 + 20;

int cnt[N][2];
int need[2];

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  // cout.precision(20);
  string s, rs;
  cin >> s;
  rs = s;
  reverse(all(rs));
  int p = nextocc(s, s + s, 1);
  need[0] = 0, need[1] = 2 * p - 1 - nextocc(s, rs + rs, 0);
  int n, x = 0, d = +1;
  cin >> n;
  ll ans = 0;
  cnt[0][0] = 1;
  while (n--){
    char type;
    int off;
    cin >> type;
    if (type == 'I'){
      x -= d, d *= -1;
    }
    else{
      cin >> off;
      x += (type == 'L'? +1 : -1) * d * off;
    }
    x %= p;
    if (x < 0) x += p;

    if (need[d == -1] >= 0) ans += cnt[(x + 10 * p - need[d == -1]) % p][0];
    if (need[d == 1] >= 0) ans += cnt[(x + need[d == 1]) % p][1];

    cnt[x][d == -1]++;
  }

  cout << ans << endl;
}