#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

using ll =long long;

#define ALL(c) (begin(c)),(end(c))
#define REP(i,n) FOR(i,0,n)
#define REPr(i,n) FORr(i,0,n)
#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)
#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())
//debug
#define DUMP(x)  cerr << #x << " = " << (x)
#define LINE()    cerr<< " (L" << __LINE__ << ")"

ll pmod(ll v,ll M){return (v%M+M)%M;}

// O(Q^2)
int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N,Q;cin >> N >> Q;

	vector<int> pos;vector<int> cs;

	REP(q,Q){
		char x;ll t;int y,z;
		cin >> x >>t >>y >> z;

		if(x=='R'){
			pos.push_back(pmod(y-t,2*N));
			cs.push_back(z);
		}
		if(x=='L'){
			pos.push_back(pmod(N+(N-1-y)-t,2*N));
			cs.push_back(z);
		}
		if(x=='C'){
			int ry=y,rz=z,ly=N+(N-1-y),lz=N+(N-1-z);
			ry=pmod(ry-t,2*N);rz=pmod(rz-t,2*N);ly=pmod(ly-t,2*N);lz=pmod(lz-t,2*N);
			if(rz<=ry)rz+=2*N;if(ly<=lz)ly+=2*N;

			ll res=0;
			for(int q2=0;q2<pos.size();q2++){
				if(IN(ry,pos[q2],rz) || IN(ry,pos[q2]+2*N,rz) || IN(lz+1,pos[q2],ly+1) || IN(lz+1,pos[q2]+2*N,ly+1))res+=cs[q2];
			}
			cout << res <<endl;
		}
	}
	return 0;
}