#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;

int main() {
	int N, Q;
	cin >> N >> Q;
	vector<int> a, b, c;
	while (Q--) {
		char x; int y, z;
		cin >> x >> y >> z;
		if (x == 'L') {
			a.push_back(-1);
			b.push_back(y);
			c.push_back(z);
		}
		else if (x == 'R') {
			a.push_back(1);
			b.push_back(y);
			c.push_back(z);
		}
		else if (x == 'C') {
			ll cnt = 0;
			for (int i = 0; i < a.size(); i++)
				if (b[i] >= y && b[i] < z)
					cnt += c[i];
			cout << cnt << endl;
		}
		for (int i = 0; i < a.size(); i++)
			if (a[i] == -1) {
				if (b[i] == 0) a[i] = 1;
				else b[i]--;
			}
			else if (a[i] == 1) {
				if (b[i] == N - 1) a[i] = -1;
				else b[i]++;
			}
	}
}