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

template<typename T> class Fenwick{
public:
	int size;vector<T> bit;
	Fenwick():Fenwick(0){}
	Fenwick(int n):size(n){bit = vector<T>(n+1);}
	T sum(int n){// [0,n)
		T s=0;
		while(n>0){
			s+=bit[n];
			n-=n&-n;//low
		}
		return s;
	}
	void add(int i,T x){//[0,...i...,n)
		i++;
		while(i<=size){
			bit[i]+=x;
			i+=i & -i;//next
		}
	}
	T sum(int a,int b){// [a,b)
		return sum(b)-sum(a);
	}
};


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

	int N,Q;cin >> N >> Q;
	Fenwick<ll> fen(2*N+2*N);// 左右反転を円環として解釈する

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

		if(x=='R'){
			int pos = y;
			pos=pmod(pos - t,2*N);
			fen.add(pos,z);fen.add(pos+2*N,z);
		}
		if(x=='L'){
			int pos = N + (N-1 -y);
			pos=pmod(pos - t,2*N);
			fen.add(pos,z);fen.add(pos+2*N,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;

			//[ry,rz) + (lz,ly]
			cout << fen.sum(ry,rz)+fen.sum(lz+1,ly+1)<<endl;
		}
	}
	return 0;
}