#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 200005;

typedef vector < int > vi;
typedef long long ll;

#define rep(i, a, b) for(int i = (a);i < (b);i++)
#define sz(x) (int)(x).size()

int n, d, k, spec = -1;
string S;
int cnt[2][N];

struct D {
	int i, j;

	D () {
		i = 0; j = 0;
	}
	
	D (int _i, int _j) {
		i = _i; j = _j;
	}
	
	D operator* (const D& rhs) const {
		if (rhs.i == 0) {
			return D(i, (j + rhs.j) % n);
		} else {
			return D((i + 1) % 2, (n - j + rhs.j) % n);
		}
	}
	
	D operator~ () const {
		if (i == 1) return D(i, j);
		return D(0, (n - j) % n);
	}
} elem[N], pref[N];

vi pi(const string &s) {
	vi p(sz(s));
	rep(i, 1, sz(s)) {
		int g = p[i - 1];
		while (g && s[i] != s[g]) g = p[g - 1];
		p[i] = g + (s[i] == s[g]);
	}
	return p;
}

vi match(const string &s, const string &pat) {
	vi p = pi(pat + '\0' + s + s), res;
	rep(i, sz(p) - 2 * sz(s), sz(p) - 1)
		if (p[i] == sz(pat)) res.push_back(i - 2 * sz(pat));
	return res; // skup pozicija t.d. ako krenemo od te pozicije u s, cikliciki, dobijemo string jednak pat
}

void precompute_special () {
	string R = S;
	reverse(R.begin(), R.end());
	vi tmp = match(S, R);
	if (tmp.empty()) return;
	spec = tmp[0] % d;
}

ll calc () {
	ll sol = 0;

	cnt[0][0] = 1;
	for (int i = 1; i <= k; i++) {
		vector <D> v;
		v.push_back(D(0, 0));
		if (spec != -1) v.push_back(D(1, spec));
		
		for (auto t : v) {
			D curr = pref[i] * (~t);
			sol += cnt[curr.i][curr.j % d];
		}
		cnt[pref[i].i][pref[i].j % d]++;
	}
	
	return sol;
}

int main () {
	cin >> S;
	n = S.size();
	d = n / ((int)match(S, S).size());

	cin >> k;
	for (int i = 1; i <= k; i++) {
		char tip;
		cin >> tip;
		if (tip == 'I') {
			elem[i] = D(1, 0);
		} else if (tip == 'R') {
			int val;
			cin >> val;
			elem[i] = D(0, val);
		} else {
			int val;
			cin >> val;
			elem[i] = ~D(0, val);
		}
		pref[i] = pref[i - 1] * elem[i];
	}
	precompute_special();
	cout << calc() << endl;
	return 0;
}