#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

template<
    class S,
    S(*op)(S a, S b),
    S(*e)()
>
struct segtree {
private:
    int N;
    vector<S> V;
public:

    segtree(int n) {
        N = 1; while (N < n) N *= 2;
        V.assign(N * 2, e());
    }
    segtree(vector<S> A) {
        N = 1; while (N < A.size()) N *= 2;
        V.assign(N * 2, e());
        rep(i, A.size()) V[N + i] = A[i];
        for (int i = N - 1; i >= 1; i--)
            V[i] = op(V[i * 2], V[i * 2 + 1]);
    }

    void set(int p, S v) {
        p += N;
        V[p] = v;
        while (p != 1) {
            p /= 2;
            V[p] = op(V[p * 2], V[p * 2 + 1]);
        }
    }
    S get(int p) {
        p += N;
        return V[p];
    }

    S prod(int l, int r) {
        S ans_l = e(), ans_r = e();
        l += N; r += N;
        while (l < r) {
            if (l & 1) ans_l = op(ans_l, V[l++]);
            if (r & 1) ans_r = op(V[--r], ans_r);
            l /= 2; r /= 2;
        }
        return op(ans_l, ans_r);
    }
};

struct S { LL x; };
S op(S l, S r) { return { l.x + r.x }; }
S e() { return { 0 }; }
using RQ = segtree<S, op, e>;

struct Query {
    char c;
    int t, y, z;
    int i;
    bool operator<(Query r) const { return t < r.t; }
};

int main() {
    int N, Q; cin >> N >> Q;

    RQ G(N * 2);

    auto applyT = [N](int p, int t)->int { return (p + t) % (2 * N); };

    vector<Query> queries;
    vector<LL> ans;
    {
        int q = 0;
        rep(i, Q) {
            char c; int t, y, z; cin >> c >> t >> y >> z;
            queries.push_back({ c,t,y,z,q });
            if (c == 'C') q++;
        }
        ans.resize(q);
    }
    sort(queries.begin(), queries.end());

    for (auto q : queries) {
        char c = q.c;
        int y = q.y, z = q.z, t = q.t;
        int i = q.i;

        if (c == 'L') {
            y = applyT(y, t);
            G.set(y, op(G.get(y), S{ z }));
        }
        if (c == 'R') {
            y = applyT(N * 2 - 1 - y, t);
            G.set(y, op(G.get(y), S{ z }));
        }
        if (c == 'C') {
            LL tmp = 0;

            int xl = applyT(y, t);
            int xr = applyT(z, t);
            if (xl < xr) tmp += G.prod(xl, xr).x;
            else tmp += G.prod(0, xr).x + G.prod(xl, 2 * N).x;

            xl = applyT(2 * N - z, t);
            xr = applyT(2 * N - y, t);
            if (xl < xr) tmp += G.prod(xl, xr).x;
            else tmp += G.prod(0, xr).x + G.prod(xl, 2 * N).x;

            ans[i] = tmp;
        }
    }

    for (LL a : ans) cout << a << endl;

    return 0;
}