#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

struct BIT{
    int n;
    vector<long long> t;
    BIT(){}
    BIT(int _n):n(_n+1), t(_n+1){}
    void add(int k, long long val){
        k++;
        while(k < n){
            t[k] += val;
            k += (k&-k);
        }
    }
    long long sum(int k){
        ll r = 0;
        while(k > 0){
            r += t[k];
            k -= (k&-k);
        }
        return r;
    }
    long long sum(int l, int r){
        return sum(r) - sum(l);
    }
};

int f(int a, int b, int md){
    return ((a - b) % md + md) % md;
}

int N, Q;

int main(){
    cin >> N >> Q;
    char x_[2], x;
    int y, z;
    const int M = 2 * N;
    BIT bit(M);
    
    FOR(t, 1, Q + 1){
        scanf("%s%d%d%d", x_, &y, &z);
        x = x_[0];
        auto h = [&](int l, int r){
            l = f(l, t, M);
            r = f(r - 1, t, M) + 1;
            if(r <= l)return bit.sum(l, M) + bit.sum(0, r);
            else return bit.sum(l, r);
        };
        if(x == 'C'){
            ll ans = h(y, z) + h(M - z, M - y);
            printf("%lld\n", ans);
        } else{
            if(x == 'L')
                y = M - 1 - y;
            y = f(y, t, M);
            bit.add(y, z);
        }
    }
}