/*
    author:  Maksim1744
    created: 23.03.2024 13:10:16
*/

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T> &v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T> &v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T> &v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>  v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> pair<T,U>& operator--           (pair<T, U> &p){--p.first; --p.second;            return  p;}
template<typename T, typename U> pair<T,U>& operator++           (pair<T, U> &p){++p.first; ++p.second;            return  p;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U> &p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>  p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define SHOW_COLORS
#include "/mnt/c/Libs/tools/print.cpp"
#else
#define show(...) void(0)
#define debugf(fun)   fun
#define debugv(var)   var
#define mclock    void(0)
#define shows     void(0)
#define debug  if (false)
#define OSTREAM(...)    ;
#define OSTREAM0(...)   ;
#endif

template<typename T>
vector<int> z_function(const T &s) {
    int n = s.size();
    vector<int> z(n, 0);
    int r = 0;
    int l = 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] - 1 > r) {
            l = i;
            r = i + z[i] - 1;
        }
    }
    return z;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    string s;
    cin >> s;

    {
        auto z = z_function(s);
        for (int i = 1; i < s.size(); ++i) {
            if (z[i] + i == s.size() && s.size() % i == 0) {
                s.resize(i);
                break;
            }
        }
    }

    int pal_shift = -1;
    {
        reverse(s.begin(), s.end());
        string t = s;
        reverse(s.begin(), s.end());
        t.pb('0');
        t += s;
        t += s;
        auto z = z_function(t);
        for (int i = s.size() + 1; i < t.size(); ++i) {
            if (z[i] != s.size()) continue;
            pal_shift = i - s.size() - 1;
            break;
        }
    }

    int n = s.size();

    int q;
    cin >> q;
    if (pal_shift == -1) {
        vector<int> poses(n, 0);
        vector<int> rev_poses(n, 0);
        poses[0] = 1;
        int pos = 0;
        bool is_rev = false;
        while (q--) {
            char c;
            cin >> c;
            if (c == 'I') {
                pos = n - pos - 1;
                is_rev = !is_rev;
            } else {
                int x;
                cin >> x;
                if (c == 'L') pos = ((pos - x) % n + n) % n;
                else pos = (pos + x) % n;
            }
            if (is_rev) rev_poses[pos]++;
            else poses[pos]++;
        }
        ll ans = 0;
        for (const auto* v : {&poses, &rev_poses}) {
            for (ll u : *v) {
                ans += u * (u - 1) / 2;
            }
        }
        cout << ans << '\n';
    } else {
        vector<pair<int, int>> funcs;

        int pos = pal_shift + (s.size() - pal_shift) / 2;
        bool even = ((s.size() - pal_shift) % 2 == 0);
        for (int i = 0; i < n; ++i) {
            assert(s[(pos + i) % n] == s[(pos - even - i + n * 2) % n]);
        }
        funcs.eb(1, 0);
        show(pos, even);
        while (q--) {
            char c;
            cin >> c;
            if (c == 'I') {
                funcs.eb(-1, n - 1);
                if (even)
                    funcs.back().second = 0;
            } else {
                int x;
                cin >> x;
                if (c == 'L') funcs.eb(1, -x);
                else funcs.eb(1, x);
            }
        }

        ll ans = 0;
        pair<int, int> cur = {1, 0};
        vector<vector<int>> goods(2, vector<int>(n));
        for (auto [k, b] : funcs) {
            cur.first *= k;
            cur.second *= k;
            cur.second += b;
            cur.second %= n;
            if (cur.second < 0) cur.second += n;

            ans += goods[max(cur.first, 0)][cur.second];
            goods[max(cur.first, 0)][cur.second]++;
            int c = pos * 2 % n;
            goods[max(-cur.first, 0)][(c - cur.second + n) % n]++;
        }
        cout << ans << '\n';
    }

    return 0;
}