#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

const int MOD = 1e9 + 1000 - 7, B = 5757;

int add(int a, int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a + MOD - b;
}

int mul(int a, int b) {
    return (1ll * a * b) % MOD;
}

const int MAXN = 1e6 + 100;
int pref[MAXN], suf[MAXN];
int power[MAXN];

bool check(int i, int j, int len) {
    int h1 = sub(pref[i + len], mul(pref[i], power[len]));
    int h2 = sub(pref[j + len], mul(pref[j], power[len]));
    return h1 == h2;
}

bool check_pal(int i, int len) {
    int h1 = sub(pref[i + len], mul(pref[i], power[len]));
    int h2 = sub(suf[i], mul(suf[i + len], power[len]));
    /// cerr << h1 << " " << h2 << endl;
    return h1 == h2;
}

bool check_pal1(int i, int len) {
    int h1 = sub(pref[i + len], mul(pref[i], power[len]));
    int h2 = sub(suf[i + 1], mul(suf[i + 1 + len], power[len]));
    /// cerr << h1 << " " << h2 << endl;
    return h1 == h2;
}

int n;

struct Line {
    int k;
    int b;

    Line(int k = 1, int b1 = 0): k(k), b(b1) {
        b = (b % n + n) % n;
    }

    Line operator()(const Line& l) const {
        Line res = Line(k * l.k, b + k * l.b);
        return res;
    }

    int hsh() const {
        return k * (b + 1);
    }

    Line inv() const {
        return Line(k, -k * b);
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    n = 100;
    Line l1 = Line(-1, 20);
    assert(l1(l1.inv()).k == 1 && (l1(l1.inv())).b == 0);

    string s;
    cin >> s;
    n = s.size();
    pref[0] = 0;
    power[0] = 1;
    for (int i = 0; i < n; ++i) {
        pref[i + 1] = add(s[i] - 'a', mul(B, pref[i]));
        power[i + 1] = mul(power[i], B);
    }

    for (int l = 1; l < n; ++l) {
        if (check(0, l, n - l) && n % l == 0) {
            n = l;
            break;
        }
    }

    s = s.substr(0, n);
    /// cerr << n << endl;

    string t = s + s + s;
    int sz = t.size();
    for (int i = 0; i < sz; ++i) {
        pref[i + 1] = add(t[i] - 'a', mul(B, pref[i]));
        power[i + 1] = mul(power[i], B);
    }
    for (int i = sz - 1; i >= 0; --i) {
        suf[i] = add(t[i] - 'a', mul(B, suf[i + 1]));
    }

    vector<Line> goal = {Line(1, 0)};
    set<int> bs;
    for (int i = 0; i < n; ++i) {
        if (check_pal(i, n)) {
            Line l = Line(-1, 2 * i + n - 1);
            bs.insert(l.b);
            /// goal.push_back(Line(-1, 2 * i + n - 1));
        }
        if (check_pal1(i, n)) {
            Line l = Line(-1, 2 * i + 1 + n - 1);
            bs.insert(l.b);
            /// goal.push_back(Line(-1, 2 * i + 1 + n - 1));
        }
    }

    for (int b : bs) {
        goal.push_back(Line(-1, b));
    }

    /// cerr << n << endl;
    /**for (auto elem : goal) {
        cerr << elem.k << " " << elem.b << endl;
    }*/

    int q;
    cin >> q;
    map<int, int> cnt;
    Line pr = Line(1, 0);
    cnt[pr.hsh()]++;
    int64_t ans = 0;
    for (int i = 0; i < q; ++i) {
        Line cur;
        char t;
        cin >> t;
        if (t == 'I') {
            cur = Line(-1, n - 1);
        } else if (t == 'R') {
            int d;
            cin >> d;
            cur = Line(1, d);
        } else {
            int d;
            cin >> d;
            cur = Line(1, -d);
        }
        pr = cur(pr);
        /// cerr << pr.k << " " << pr.b << endl;
        for (auto elem : goal) {
            ans += cnt[elem.inv()(pr).hsh()];
        }
        cnt[pr.hsh()]++;
    }
    cout << ans << "\n";
    
    return 0;
}