#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int SZ = 202020;

int n, q, k[SZ], f[SZ], c[2][SZ];
string S;

int cyclic(string S, string T) {
	S = S + S;

	int n = S.size();
	int m = T.size();

	vector<int> F(m);
	for (int i = 1, p = 0; i < m; i++) {
		while (p && T[p] != T[i]) {
			p = F[p - 1];
		}
		if (T[p] == T[i]) F[i] = ++p;
	}

	for (int i = 0, p = 0; i < n; i++) {
		while (p == m || (p && S[i] != T[p])) {
			p = F[p - 1];
		}
		if (S[i] == T[p]) ++p;
		if (p == m) {
			return i + 1 - p;
		}
	}
	return -1;
}
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	cin >> S;
	n = S.size();

	vector<int> F(n);
	for (int i = 1, p = 0; i < n; i++) {
		while (p && S[p] != S[i]) {
			p = F[p - 1];
		}
		if (S[p] == S[i]) F[i] = ++p;
	}
	int t = n;
	for (int p = n - 1; ; ) {
		if (n % (n - F[p]) == 0) {
			t = n - F[p];
			break;
		}
		else p = F[p - 1];
	}

	string T = S.substr(0, t);
	reverse(T.begin(), T.end());
	int r = cyclic(S.substr(0, t), T);

	cin >> q;

	ll ans = 0;
	c[0][0]++;
	for (int i = 1; i <= q; i++) {
		string K; cin >> K;
		if (K == "R") {
			int x; cin >> x;
			k[i] = (k[i - 1] + x) % t;
			f[i] = f[i - 1];
		}
		else if (K == "L") {
			int x; cin >> x;
			k[i] = (k[i - 1] + n - x) % t;
			f[i] = f[i - 1];
		}
		else {
			k[i] = (t - k[i]) % t;
			f[i] = f[i - 1] ^ 1;
		}
		ans += c[f[i]][k[i]];
		if (r != -1) {
			ans += c[f[i] ^ 1][(r + t - k[i]) % t];
		}
		c[f[i]][k[i]]++;
	}

	cout << ans << '\n';
}