#include <atcoder/all>
using namespace std;
using namespace atcoder;
using namespace internal;

int main(){
    int N, Q, t, y, z;
    char x;
    cin >> N >> Q;
    N *= 2;
    fenwick_tree<long> fw(N);
    auto f = [&](int l, int r){ return l <= r ? fw.sum(l, r) : fw.sum(0, r) + fw.sum(l, N); };
    while(Q--){
        cin >> x >> t >> y >> z;
        if(x != 'C'){
            if(x == 'L') y = -y - 1;
            fw.add(safe_mod(y - t, N), z);
        }else{
            int l1 = safe_mod(y - t, N);
            int r1 = safe_mod(z - t, N);
            int l2 = safe_mod(-z - t, N);
            int r2 = safe_mod(-y - t, N);
            cout << f(l1, r1) + f(l2, r2) << '\n';
        }
    }
}