#include <bits/stdc++.h>
using namespace std;

#define repu(i, begin, end) for (__typeof(begin) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define repe(i, begin, end) for (__typeof(begin) i = (begin); i != (end) + 1 - 2 * ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define mem(a, x) memset(a, x, sizeof(a))
#define all(a) a.begin(), a.end()
#define count_bits(x) __builtin_popcount(x)
#define count_bitsll(x) __builtin_popcountll(x)
#define least_bits(x) __builtin_ffs(x)
#define least_bitsll(x) __builtin_ffsll(x)
#define most_bits(x) 32 - __builtin_clz(x)
#define most_bitsll(x) 64 - __builtin_clz(x)

vector<string> split(const string &s, char c) {
	vector<string> v;
	stringstream ss(s);
	string x;
	while (getline(ss, x, c)) v.push_back(x);
	return v;
}

#define error(args...) { vector<string> _v = split(#args, ','); err(_v.begin(), args); }

void err(vector<string>::iterator it) {}

template<typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
	cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << '\n';
	err(++it, args...);
}

typedef long long ll;
const int MOD = 1000000007;

template<class T> inline T tmin(T a, T b) {return (a < b) ? a : b;}
template<class T> inline T tmax(T a, T b) {return (a > b) ? a : b;}
template<class T> inline void amax(T &a, T b) {if (b > a) a = b;}
template<class T> inline void amin(T &a, T b) {if (b < a) a = b;}
template<class T> inline T tabs(T a) {return (a > 0) ? a : -a;}
template<class T> T gcd(T a, T b) {while (b != 0) {T c = a; a = b; b = c % b;} return a;}

// left = 0, right = 1
// direction, position, time, total
struct Fish {
	int dir, pos, tm, tot;
};

int N;

inline int calc_pos(int pos, int tm, int dir) {
	tm %= (2 * N);
	if (dir) {
		if (pos + tm < N) return pos + tm;
		else if (tm < 2 * N - pos) return (2 * N - pos - tm - 1);
		else return (tm - 2 * N + pos);
	}
	else {
		if (tm <= pos) return pos - tm;
		else if (tm <= pos + N) return tm - pos - 1;
		else return (2 * N - tm + pos);
	}
}


int main(int argc, char *argv[]) {
    ios_base::sync_with_stdio(false);
    int Q, y, z;
    char x;

    cin >> N >> Q;
    vector<Fish> fs;

    repe(t, 1, Q) {
    	cin >> x >> y >> z;
    	if (x == 'L') {
    		fs.push_back((Fish) {0, y, t, z});
    	}
    	if (x == 'R') {
    		fs.push_back((Fish) {1, y, t, z});
    	}
    	if (x == 'C') {
    		ll ans = 0;
    		repu(i, 0, fs.size()) {
    			int pos = calc_pos(fs[i].pos, t - fs[i].tm, fs[i].dir);
    			//error(pos);
    			if (pos >= y && pos < z) ans += fs[i].tot;
    		}
    		printf("%lld\n", ans);
    	}
    }
    return 0;
}