// #pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
// #include <x86intrin.h>
using namespace std;
#if __cplusplus >= 202002L
using namespace numbers;
#endif

// p[i]: largest proper suffix(prefix if Reverse) ending(starting if Reverse) at i
// that is also a prefix(suffix if Reverse)
// O(n)
template<class Char_Type, bool Reverse = false>
vector<int> prefix_function(vector<Char_Type> s){
	if(Reverse) reverse(s.begin(), s.end());
	int n = (int)s.size();
	vector<int> pi(n);
	for(auto i = 1; i < n; ++ i){
		int len = pi[i - 1];
		while(len && s[i] != s[len]) len = pi[len - 1];
		if(s[i] == s[len]) pi[i] = len + 1;
	}
	if(Reverse) reverse(pi.begin(), pi.end());
	return pi;
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(ios::badbit | ios::failbit);
	vector<int> s;
	{
		string t;
		cin >> t;
		for(auto c: t){
			s.push_back(c - 'a');
		}
	}
	int n = (int)s.size(), p;
	for(auto len = 1; len <= (int)s.size(); ++ len){
		if((int)s.size() % len == 0){
			for(auto i = len; i < (int)s.size(); ++ i){
				if(s[i] != s[i - len]){
					goto FAIL2;
				}
			}
			p = len;
			break;
			FAIL2:;
		}
	}
	int convert = -1;
	{
		auto rs = s;
		ranges::reverse(rs | ranges::views::drop(1));
		for(auto i = 0; i < n; ++ i){
			rs.push_back(rs[i]);
		}
		rs.insert(rs.begin(), s.begin(), s.end());
		auto pi = prefix_function(rs);
		for(auto i = (int)s.size() * 2; i <= (int)rs.size(); ++ i){
			if(pi[i - 1] >= (int)s.size()){
				convert = (i % n + n) % n;
				break;
			}
		}
	}
	int qn;
	cin >> qn;
	long long res = 0;
	array<vector<int>, 2> cnt{vector<int>(p), vector<int>(p)};
	cnt[0][0] = 1;
	array<int, 2> cur{};
	for(auto qi = 0; qi < qn; ++ qi){
		char type;
		cin >> type;
		array<int, 2> op{};
		if(type == 'I'){
			op = {1, n - 1};
		}
		else{
			int shift;
			cin >> shift, shift %= n;
			if(type == 'L'){
				shift = (n - shift) % n;
			}
			op[1] = shift;
		}
		if(op[0]){
			cur[1] = (op[1] - cur[1] + n) % n;
		}
		else{
			cur[1] = (op[1] + cur[1]) % n;
		}
		cur[0] ^= op[0];
		res += cnt[cur[0]][cur[1] % p];
		if(~convert){
			res += cnt[cur[0] ^ 1][(p - convert % p - cur[1] % p + p) % p];
		}
		++ cnt[cur[0]][cur[1] % p];
	}
	cout << res << "\n";
	return 0;
}

/*

*/