// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
// #define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

#define ui unsigned long long
const int N = 2e5, bs = 29;
char s[N + 5];
int a, b, nxt[N + 5], id;
ui pw[N + 5], pre[N + 5], suf[N + 5];
bool is;
vi st;
struct node {
	int o, p, q, s[N + 5], t[N + 5], S, T;
	void ins() {
		++s[p], ++t[q];
	}
	void add(int n) {
		if(!o) p = (p + n) % S, q = (q + n) % T;
		else p = (p + n + S) % S, q = (q + n + T) % T;
	}
	int ask() {
		if(!o) return s[p];
		else {
			if(is) return t[(q + T + 1) % T];
			else if(id != -1) return t[(q + T + id) % T];
			return 0;
		}
	}
} S, T;

ui F(int l, int r) {
	return !l ? pre[r] : pre[r] - pre[l - 1] * pw[r - l + 1];
}
ui G(int l, int r) {
	return suf[l] - suf[r + 1] * pw[r - l + 1];
}
bool ck(int n) {
	rep(i, 0, n - 1) if(s[i] != s[n - i - 1]) return 0;
	return 1;
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> s >> b;
	a = strlen(s);
	pre[0] = s[0];
	rep(i, 1, a - 1) pre[i] = pre[i - 1] * bs + s[i];
	per(i, a - 1, 0) suf[i] = suf[i + 1] * bs + s[i];
	pw[0] = 1;
	rep(i, 1, a) pw[i] = pw[i - 1] * bs;

	nxt[0] = -1;
	int j = -1;
	rep(i, 1, a) {
		for(; ~j && s[i] != s[j + 1]; j = nxt[j]);
		if(s[i] == s[j + 1]) ++j;
		nxt[i] = j;
	}
	int tmp = a - 1 - nxt[a - 1];
	if(a % tmp) tmp = a;
	S.S = T.S = tmp;

	T.o = 1;
	is = ck(tmp);
	if(!is) {
		S.T = T.T = tmp;
		id = -1;
		rep(i, 0, tmp - 2) if(F(0, i) == G(0, i) && F(i + 1, tmp - 1) == G(i + 1, tmp - 1)) {
			if(id == -1) id = i;
			else assert(0);
		}
		// cerr << id << endl;
	}
	else S.T = T.T = tmp;

	char o;
	int x, y = 0;
	ll ans = 0;
	rep(i, 1, b) {
		cin >> o;
		y ? T.ins() : S.ins();
		if(o == 'I') {
			S.o ^= 1, T.o ^= 1;
			y ^= 1;
		}
		else {
			cin >> x;
			if(o == 'L') x = a - x;
			S.add(x), T.add(x);
		}
		ans += S.ask() + T.ask();
	}
	cout << ans;
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}