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

template<typename T>
class SegTree{
    size_t n;
    vector<T> data;
    void modify(size_t i, T v){   // set value at index i to v.
        for (data[i += n] = v; i > 1; i >>= 1) data[i>>1] = data[i] + data[i^1];
    }
    T query(size_t L, size_t R){  // sum on interval [L, R)
        T ret = 0;
        for (L += n, R += n; L < R; L >>= 1, R >>= 1){
            if (L & 1) ret += data[L++];
            if (R & 1) ret += data[--R];
        }
        return ret;
    }
    int calc_pos0(int t, int pos){
        int pos0 = (pos - t) % (int) n;
        if (pos0 < 0) pos0 += (int) n;
        return pos0;
    }
    T query_core(int t, int L, int R){ // [L,R]
        int L0 = calc_pos0(t, L);
        int R0 = calc_pos0(t, R);
        if (L0 <= R0){
            return query(L0, R0 + 1);
        }else{
            return query(L0, n) + query(0, R0 + 1);
        }
    }
public:
    SegTree(size_t _n): n(_n), data(2 * _n, 0) {}
    SegTree(const vector<T> &src): n(src.size()), data(2 * n, 0) {init(src);}
    void init(const vector<T> &src){
        for (size_t i = 0; i != n; ++i) data[n + i] = src[i];
        for (size_t i = n - 1; i != 0; --i) data[i] = data[i*2] + data[i*2+1];
    }
    void addR(int t, int y, T z){
        int y0 = calc_pos0(t, y);
        modify(y0, data[n + y0] + z);
    }
    void addL(int t, int y, T z){
        int y0 = calc_pos0(t, (int)n - 1 - y);
        modify(y0, data[n + y0] + z);
    }
    T query(int t, int y1, int z1){
        return query_core(t, y1, z1 - 1) + query_core(t, n - z1, n - 1 - y1);
    }
};


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q;
    cin >> N >> Q;
    SegTree<long long> seg(2 * N);
    while (Q--){
        char x;
        int t, y, z;
        cin >> x >> t >> y >> z;
        if (x == 'L'){
            seg.addL(t, y, (long long)z);
        }else if (x == 'R'){
            seg.addR(t, y, (long long)z);
        }else if (x == 'C'){
            cout << seg.query(t, y, z) << '\n';
        }
    }
    return 0;
}