#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(){
    int n, q;
    cin >> n >> q;
    fenwick_tree<ll> lfw(40005), rfw(40005);
    char x;
    int l1 = 0, r1 = n, r2 = 40005, l2 = r2 - n, y, z;
    while(q--){
        cin >> x >> y >> z;
        if(x == 'L')lfw.add(l1 + y, z);
        if(x == 'R')rfw.add(l2 + y, z);
        if(x == 'C')cout << lfw.sum(l1 + y, l1 + z) + rfw.sum(l2 + y, l2 + z) << '\n';
        lfw.add(r1, rfw.sum(r2 - 1, r2));
        rfw.add(l2 - 1, lfw.sum(l1, l1 + 1));
        l1++, r1++, l2--, r2--;
    }
}