#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template <class T> struct fenwick_tree {
    using U = T;

    public:
    fenwick_tree() : _n(0) {}
    fenwick_tree(int n) : _n(n), data(n) {}

    void add(int p, T x) {
        assert(0 <= p && p < _n);
        p++;
        while (p <= _n) {
            data[p - 1] += U(x);
            p += p & -p;
        }
    }

    T sum(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        return sum(r) - sum(l);
    }

    private:
    int _n;
    std::vector<U> data;

    U sum(int r) {
        U s = 0;
        while (r > 0) {
            s += data[r - 1];
            r -= r & -r;
        }
        return s;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N, Q, r, t, y, z;
    cin >> N >> Q;
    fenwick_tree<ll> fw(2 * N);
    char x;

    auto safe_mod = [&](int v, int mod){
        v %= mod;
        if(v < 0)v += mod;
        return v;
    };

    auto f = [&](int l, int r){
        if(l <= r) return fw.sum(l, r);
        return fw.sum(0, r) + fw.sum(l, 2 * N);
    };

    while(Q--){
        cin >> x >> t >> y >> z;
        if(x != 'C'){
            if(x == 'L') y = 2 * N - 1 - y;
            y = safe_mod(y - t, 2 * N);
            fw.add(y, z);
        }else{
            int l1 = safe_mod(y - t, 2 * N);
            int r1 = safe_mod(z - t, 2 * N);
            int l2 = safe_mod((2 * N - z) - t, 2 * N);
            int r2 = safe_mod((2 * N - y) - t, 2 * N);
            cout << f(l1, r1) + f(l2, r2) << '\n';
        }
    }
}