//ドワンゴ　フィッシング　8020
//SYAKYO
//http://yukicoder.me/submissions/12291
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> P;
typedef pair<int,pair<int,int>> PP;
typedef long long ll;

const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9+7;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};

//fenwick_tree
template <class T>
struct BIT{
	int N;vector<T>bit;
	BIT(int n):N(n),bit(n+1){}
	void add(T k,int i){i++;for(int x=i;x<=N;x+=x&-x)bit[x]+=k;}
	T sum(int i){i++;T r=0;for(int x=i;x>0;x-=x&-x)r+=bit[x];return r;}
	T sum(int l,int r){return l<=r ? sum(r)-sum(l-1):sum(r)+sum(l,N-1);}
	T get(int i){return sum(i) - sum(i-1);}
	void set(T k,int i){add(k-get(i),i);}
};

int fix(int a,int N2){
	return (a%N2+N2)%N2;
}
int main(void) {	
	int N,Q;
	cin >> N >> Q;
	BIT<ll> lfw(2*N+1),rfw(2*N+1);
	char x;
	int y,z;
	int N2 = N+N;
	for(int t=1;t<=Q;t++){
		cin >> x >> y >> z;
		if(x == 'L'){
			lfw.add(z,fix(y+t,N2));
		}
		if(x == 'R'){
			rfw.add(z,fix(y-t,N2));
		}
		if(x == 'C'){
			z--;
			ll ret = 0;
			ret += lfw.sum(fix(y+t,N2),fix(z+t,N2));
			ret += lfw.sum(fix(N2-1-z +t,N2),fix(N2-1-y +t,N2));
			ret += rfw.sum(fix(y-t,N2),fix(z-t,N2));
			ret += rfw.sum(fix(N2-1-z -t,N2),fix(N2-1-y -t,N2));
			cout << ret << endl;
		}
	}
	return 0;
}