#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 4e5 + 5;

int m, n, len, st, kmp[N], R[2], a[N];
int buc[2][N];
pii b[N];
long long ans;
char s[N], t[N];

inline void binary(int l, int r) {
	if(l == r) {
		if(a[l] == -1) ans += ( R[1] == 0 );
		else ans += ( a[l] % len == R[0] );
		return ;
	}
	int mid = l + r >> 1;
	binary(l, mid); binary(mid + 1, r);
	
	b[mid + 1] = mkp(0, 0); vc<pii> tra;
	lep(i, mid, l) {
		if(a[i] == -1) b[i].first = b[i + 1].first ^ 1, b[i].second = b[i + 1].second;
		else if(b[i + 1].first) b[i].first = b[i + 1].first, b[i].second = (b[i + 1].second + m - a[i]) % m;
		else b[i].first = b[i + 1].first, b[i].second = (b[i + 1].second + a[i]) % m;
		auto [u, v] = b[i]; v %= len;
		tra.pb(mkp(u, v)); ++buc[u][v];
	}
	b[mid] = mkp(0, 0);
	rep(i, mid + 1, r) {
		if(a[i] == -1) b[i].first = b[i - 1].first ^ 1, b[i].second = (m - b[i - 1].second) % m;
		else b[i].first = b[i - 1].first, b[i].second = (b[i - 1].second + a[i]) % m;
		auto [u, v] = b[i]; v %= len;
		if(u == 0) {
			ans += buc[0][(len + R[0] - v) % len];
			if(R[1] != -1) ans += buc[1][(len + R[1] - v) % len];
		}
		else {
			ans += buc[1][(len + v - R[0]) % len];
			if(R[1] != -1) ans += buc[0][(len + v - R[1]) % len];
		}
	}
	for(auto [u, v] : tra) buc[u][v] = 0;
	// cerr << l << " " << r << " " << ans << endl;
}

signed main() {
	scanf("%s", s); m = strlen(s);
	n = read();
	for(int i = 1, d; i <= n; i++) {
		char ch = getchar(); while(ch != 'R' && ch != 'L' && ch != 'I') ch = getchar();
		if(ch == 'I') a[i] = -1;
		else d = read(), a[i] = ch == 'L' ? d : m - d;
	}
	
	rep(i, 0, m - 1) t[i] = t[i + m] = s[m - i - 1];
	kmp[0] = st = -1;
	for(int i = 1, j = -1; i < m; i++) {
		while(j != -1 && s[i] != s[j + 1]) j = kmp[j];
		if(s[i] == s[j + 1]) ++j; kmp[i] = j;
	}
	len = (m % (m - kmp[m - 1] - 1) == 0) ? m - kmp[m - 1] - 1 : m;
	for(int i = 0, j = -1; i < 2 * m; i++) {
		while((j == m - 1) || (j != -1 && t[i] != s[j + 1])) j = kmp[j];
		if(t[i] == s[j + 1]) ++j; 
		if(j == m - 1) st = i - m + 1;
	}
	R[0] = 0; R[1] = st == -1 ? -1 : st % len;
	
	binary(1, n);
	
	cout << ans << endl;
	
	return 0;
}