#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v, w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 2;

struct bit {
	vector<ll> v;
	bit(int n) : v(n + 1) {}
	ll sum(int i) {
		ll res = 0;
		for (; i > 0; i -= i & -i) res += v[i];
		return res;
	}
	ll sum(int i, int j) {
		return sum(j) - sum(i);
	}
	void add(int i, ll x) {
		for (i++; i < v.size(); i += i & -i) v[i] += x;
	}
};

int main() {
	int N, Q;
	cin >> N >> Q;
	bit bl(50000), br(50000);
	int xl = 0, xr = 25000;
	while (Q--) {
		char x; int y, z;
		cin >> x >> y >> z;
		if (x == 'L')
			bl.add(xl + y, z);
		else if (x == 'R')
			br.add(xr + y, z);
		else if (x == 'C') {
			ll sum = 0;
			sum += bl.sum(xl + y, xl + z);
			sum += br.sum(xr + y, xr + z);
			cout << sum << endl;
		}
		br.add(xr - 1, bl.sum(xl, xl + 1));
		bl.add(xl + N, br.sum(xr + N - 1, xr + N));
		xl++; xr--;
	}
}