#include <bits/stdc++.h>
using namespace std; 
const int P = 998244353; 
const int N = 200050; 

int n, q; 
char arr[100005]; 
mt19937 Rand(time(0)); 
struct Matrix {
    int a00, a01, a10, a11; 
    friend Matrix operator*(const Matrix &a, const Matrix &b) {
        Matrix c; 
        c.a00 = (1ll * a.a00 * b.a00 + 1ll * a.a01 * b.a10) % P; 
	    c.a01 = (1ll * a.a00 * b.a01 + 1ll * a.a01 * b.a11) % P; 
	    c.a10 = (1ll * a.a10 * b.a00 + 1ll * a.a11 * b.a10) % P; 
	    c.a11 = (1ll * a.a10 * b.a01 + 1ll * a.a11 * b.a11) % P; 
	    return c;
    }
} v[N], fl[N], rv[N], frv[N], I[N], fI[N], a, b, base; 
int sz[N], ls[N], rs[N], dt[N], tot, rt, tf[N], tr[N]; 
inline int newNode(int k) {
    int o = ++tot; sz[o] = 1, dt[o] = Rand(); 
    if (k == 0) v[o] = rv[o] = I[o] = a, fl[o] = frv[o] = fI[o] = b; 
    else v[o] = rv[o] = I[o] = b, fl[o] = frv[o] = fI[o] = a; 
    return o; 
}
inline void pushup(int o) {
    if (!o) return; 
    sz[o] = sz[ls[o]] + sz[rs[o]] + 1; 
    v[o] = v[ls[o]] * I[o] * v[rs[o]]; 
    fl[o] = fl[ls[o]] * fI[o] * fl[rs[o]]; 
    rv[o] = rv[rs[o]] * I[o] * rv[ls[o]]; 
    frv[o] = frv[rs[o]] * fI[o] * frv[ls[o]]; 
}
inline void addf(int o) {
    if (!o) return; 
    swap(v[o], fl[o]); swap(rv[o], frv[o]); swap(I[o], fI[o]); 
    tf[o] ^= 1; 
}
inline void addr(int o) {
    if (!o) return; 
    swap(v[o], rv[o]); swap(fl[o], frv[o]); swap(ls[o], rs[o]); 
    tr[o] ^= 1; 
}
inline void pushdown(int o) {
    if (!o) return; 
    if (tf[o]) addf(ls[o]), addf(rs[o]), tf[o] = 0; 
    if (tr[o]) addr(ls[o]), addr(rs[o]), tr[o] = 0; 
}
int merge(int x, int y) {
    if (!x || !y) return x + y; 
    if (dt[x] < dt[y]) return pushdown(x), rs[x] = merge(rs[x], y), pushup(x), x; 
    return pushdown(y), ls[y] = merge(x, ls[y]), pushup(y), y; 
}
void split(int o, int S, int &x, int &y) {
    if (!o) return x = y = 0, void(); pushdown(o); 
    if (sz[ls[o]] + 1 <= S) x = o, split(rs[o], S - sz[ls[o]] - 1, rs[o], y); 
    else y = o, split(ls[o], S, x, ls[o]); 
    pushup(o); 
}
int build(int l, int r) {
    if (l == r) return newNode(arr[l] == 'W' ? 0 : 1); 
    int mid = l + r >> 1; return merge(build(l, mid), build(mid + 1, r)); 
}

int main(void) {
    a.a00 = a.a01 = a.a11 = 1, a.a10 = 0; 
    b.a00 = 0, b.a01 = P - 1, b.a10 = 1, b.a11 = 2; 

    // 初始化单位矩阵
    base.a00 = base.a11 = 1, base.a10 = base.a01 = 0; 
    v[0] = fl[0] = rv[0] = frv[0] = I[0] = fI[0] = base; 

    base.a00 = base.a01 = base.a11 = 1, base.a10 = 0; 

    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> q >> arr + 1; 
    rt = build(1, n); 

    auto ans = base * v[rt]; 
    cout << ans.a11 << " " << ans.a01 << "\n"; 

    char op[10]; int l, r, x, y, z; 
    while (q--) {
        cin >> op; 
        if (op[0] == 'A') {
            cin >> op; 
            rt = merge(rt, newNode(op[0] == 'W' ? 0 : 1)); 
        } else if (op[0] == 'F') {
            cin >> l >> r; split(rt, r, y, z); split(y, l - 1, x, y); 
            addf(y); rt = merge(merge(x, y), z); 
        } else {
            cin >> l >> r; split(rt, r, y, z); split(y, l - 1, x, y); 
            addr(y); rt = merge(merge(x, y), z); 
        }
        auto ans = base * v[rt]; 
        cout << ans.a11 << " " << ans.a01 << "\n"; 
    }
    return 0; 
}