#include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
const int N = 2e5 + 5;
int n, q, ch[N][2], fa[N], nodes, siz[N], l, r, x;
bool w[N], tagf[N], tagr[N]; char s[N], op[10];
struct Matrix {
	int a, b, c, d;
	Matrix operator * (const Matrix &B) const {
		Matrix res;
		res. a = (1ll * a * B. a + 1ll * b * B. c) % MOD;
		res. b = (1ll * a * B. b + 1ll * b * B. d) % MOD;
		res. c = (1ll * c * B. a + 1ll * d * B. c) % MOD;
		res. d = (1ll * c * B. b + 1ll * d * B. d) % MOD;
		return res;
	}
} W = {1, 0, 1, 1}, E = {2, 1, MOD - 1, 0}, mat[N];
inline int PLUS(int x, int y) {
	x += y;
	return x >= MOD ? x - MOD : x;
}
inline void pushup(int x) {
	siz[x] = siz[ch[x][0]] + 1 + siz[ch[x][1]];
	mat[x] = mat[ch[x][0]] * (w[x] ? E : W) * mat[ch[x][1]];
}
inline void rotate(int x) {
	int y = fa[x], z = fa[y]; bool k = ch[y][1] == x;
	ch[z][ch[z][1] == y] = x, fa[x] = z;
	ch[y][k] = ch[x][!k], fa[ch[x][!k]] = y;
	ch[x][!k] = y, fa[y] = x;
	fa[0] = 0, pushup(y);
}
inline void splay(int x, int t = 0) {
	while (fa[x] ^ t) {
		int y = fa[x];
		if (fa[y] ^ t)
			rotate((ch[y][1] == x) ^ (ch[fa[y]][1] == y) ? x : y);
		rotate(x);
	} pushup(x);
}
int build(int l, int r) {
	if (l > r) return 0;
	int mid = l + r >> 1, p = ++ nodes;
	w[p] = s[mid] == 'E';
	if (l == r) {
		siz[p] = 1, mat[p] = w[p] ? E : W;
		return nodes;
	}
	fa[ch[p][0] = build(l, mid-1)] = p;
	fa[ch[p][1] = build(mid+1, r)] = p;
	pushup(p); return p;
}
inline void flip(int x) { if (! x) return ;
	w[x] ^= 1, tagf[x] ^= 1;
	mat[x]. a = PLUS(mat[x]. a, mat[x]. c);
	mat[x]. b = PLUS(mat[x]. a, MOD - PLUS(mat[x]. b, mat[x]. d));
	mat[x]. d = PLUS(mat[x]. d, mat[x]. c = mat[x]. c ? MOD - mat[x]. c : 0);
}
inline void reverse(int x) { if (! x) return ;
	tagr[x] ^= 1, swap(ch[x][0], ch[x][1]);
	int d = mat[x]. d; mat[x]. d = PLUS(mat[x]. a, MOD - PLUS(mat[x]. b, mat[x]. b));
	mat[x]. a = PLUS(PLUS(mat[x]. b, mat[x]. b), d);
	mat[x]. c = PLUS(mat[x]. c, PLUS(PLUS(mat[x]. d, mat[x]. d), MOD - PLUS(d, d)));
}
inline void pushdown(int x) {
	if (tagf[x]) tagf[x] = 0, flip(ch[x][0]), flip(ch[x][1]);
	if (tagr[x]) tagr[x] = 0, reverse(ch[x][0]), reverse(ch[x][1]);
}
inline void insert(char c) {
	int x = 0;
	while (ch[x][1])
		pushdown(x = ch[x][1]);
	ch[x][1] = ++ nodes, fa[nodes] = x, w[nodes] = c == 'E';
	splay(nodes);
}
inline int find(int k, int t = 0) {
	if (! k) return 0;
	int x = ch[0][1];
	while (1) { pushdown(x);
		if (k <= siz[ch[x][0]]) x = ch[x][0];
		else if (k == siz[ch[x][0]] + 1) return splay(x, t), x;
		else k -= siz[ch[x][0]] + 1, x = ch[x][1];
	}
}
inline void update(int x, bool op) {
	op ? flip(x) : reverse(x);
	if (fa[x]) pushup(fa[x]);
	if (fa[fa[x]]) pushup(fa[fa[x]]);
}
#define print printf ("%d %d\n", mat[ch[0][1]]. a, PLUS(mat[ch[0][1]]. a, mat[ch[0][1]]. c))
int main() {
	mat[0] = {1, 0, 0, 1};
	scanf ("%d%d%s", &n, &q, s+1), ch[0][1] = build(1, n), fa[0] = 0;
	print;
	while (q--) {
		scanf ("%s", op);
		if (op[0] == 'A')
			scanf ("%s", op), insert(op[0]);
		else {
			scanf ("%d%d", &l, &r);
			if (r == nodes)
				update(ch[find(l-1)][1], op[0] == 'F');
			else
				x = find(l - 1), x = find(r + 1, x), update(ch[x][0], op[0] == 'F');
		} print;
	} return 0;
}