#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

using namespace std;
typedef long long ll;

const int MAXN = 20020;
ll state[2][MAXN];
ll Next[2][MAXN];

int main(void) {
    int N, Q;
    cin >> N >> Q;
    while (Q--) {
        char x;
        int y, z;
        cin >> x;
        cin >> y >> z;
        if (x == 'R') {
            state[1][y] += z;
        } else if (x == 'L') {
            state[0][y] += z;
        } else {
            ll sum = 0;
            for (int i = y; i < z; i++) {
                sum += state[0][i] + state[1][i];
            }
            cout << sum << endl;
        }
        for (int i = 1; i < N; i++) {
            Next[1][i] = state[1][i-1];
        }
        Next[1][0] = state[0][0];
        for (int i = 0; i < N-1; i++) {
            Next[0][i] = state[0][i+1];
        }
        Next[0][N-1] = state[1][N-1];
        for (int i = 0; i < N; i++) {
            state[0][i] = Next[0][i];
            state[1][i] = Next[1][i];
        }
    }
    return 0;
}