#include <bits/stdc++.h>

using ll = signed long long int;

#define all(x) (x).begin(), (x).end()

using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

using vi = vector<int>;

vi z_func(const string& s) {
    int n = s.size();
    vi z(n);
    int l = 0, r = 0;
    for (int i = 1; i < n; ++i) {
        if (i < r) {
            z[i] = min(r - i - 1, z[i - l]);
        }
        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 main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    string s;
    cin >> s;
    vi z = z_func(s);
    int n = s.size(), period = n;
    for (int i = 1; i < n; ++i) {
        if (n % i == 0 && i + z[i] == n) {
            period = i;
            break;
        }
    }
    string p(s.begin(), s.begin() + period);
    string pr(p.rbegin(), p.rend());
    int x = -1;
    vi z2 = z_func(p + "$" + pr + pr);
    for (int i = period + 1; i < z2.size(); ++i) {
        if (z2[i] == period) {
            x = i - period - 1;
            break;
        }
    }
    int q;
    cin >> q;
    vector<map<int, int>> cnt(2);
    cnt[0][0] = 1;
    int pref = 0;
    bool flag = 0;
    ll ans = 0;
    while (q--) {
        char c;
        cin >> c;
        if (c == 'I') {
            flag ^= 1;
        } else {
            int d;
            cin >> d;
            pref += (flag ^ (c == 'R') ? 1 : -1) * d;
            pref %= period;
            if (pref < 0) {
                pref += period;
            }
        }
        if (cnt[flag].count(pref)) {
            ans += cnt[flag][pref];
        }
        if (x != -1) {
            int di = ((flag ? x : -x) - pref) % period;
            if (di < 0) {
                di += period;
            }
            if (cnt[flag ^ 1].count(di)) {
                ans += cnt[flag ^ 1][di];
            }
        }
        ++cnt[flag][pref];
    }
    cout << ans << endl;
}