#include <atcoder/all>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q, r, t, y, z;
    cin >> N >> Q;
    atcoder::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;
            fw.add(safe_mod(y - t, 2 * N), z);
        }else{
            int l1 = safe_mod(y - t, 2 * N);
            int r1 = safe_mod(z - t, 2 * N);
            int l2 = safe_mod(-z - t, 2 * N);
            int r2 = safe_mod(-y - t, 2 * N);
            cout << f(l1, r1) + f(l2, r2) << '\n';
        }
    }
}