#include using namespace std; #define REP(i,a,b) for(i=a;i'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} void reader(double *x){scanf("%lf",x);} int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;} template void reader(T *x, S *y){reader(x);reader(y);} template void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);} template void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);} void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);} void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);} void writer(double x, char c){printf("%.15f",x);mypc(c);} void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);} void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);} template void writerLn(T x){writer(x,'\n');} template void writerLn(T x, S y){writer(x,' ');writer(y,'\n');} template void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');} template void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');} char memarr[77000000]; void *mem = memarr; #define MD 1000000007 template struct fenwick{ int size, memory; T *data; void malloc(int mem){memory=mem;data=(T*)std::malloc(sizeof(T)*mem);} void *malloc(int mem, void *workMemory){memory=mem;data=(T*)workMemory;return (void*)(data+mem);} void free(void){memory=0;free(data);} void init(int N){size=N;memset(data,0,sizeof(T)*N);} void add(int k, T val){while(k=0)res+=data[k],k=(k&(k+1))-1;return res;} T range(int a, int b){if(a>b)return 0;return get(b)-get(a-1);} int kth(T k){int i=0,j=size,c;T v;while(i tR, tL; int main(){ int i, j, k; int a, b; ll res; reader(&N,&Q); mem = tR.malloc(2*N, mem); mem = tL.malloc(2*N, mem); tR.init(2*N); tL.init(2*N); while(Q--){ reader(X,&T,&Y,&Z); if(X[0]=='R'){ a = (Y - T) % (2*N); if(a < 0) a += 2*N; tR.add(a, Z); // printf("tR add %d %d\n",a,Z); } if(X[0]=='L'){ a = (N - 1 - Y - T) % (2*N); if(a < 0) a += 2*N; tL.add(a, Z); // printf("tL add %d %d\n",a,Z); } if(X[0]=='C'){ res = 0; Z--; a = (Y - T) % (2*N); b = (Z - T) % (2*N); if(a < 0) a += 2*N; if(b < 0) b += 2*N; if(a <= b){ res += tR.range(a, b); // printf("tR range %d %d\n",a,b); } else { res += tR.range(0,b-1)+tR.range(a+1,2*N-1); // printf("tR range %d %d, %d %d\n",0,b-1,a+1,2*N-1); } a = (2*N - 1 - Z - T) % (2*N); b = (2*N - 1 - Y - T) % (2*N); if(a < 0) a += 2*N; if(b < 0) b += 2*N; if(a <= b){ res += tR.range(a, b); // printf("tR range %d %d\n",a,b); } else { res += tR.range(0,b-1)+tR.range(a+1,2*N-1); // printf("tR range %d %d, %d %d\n",0,b-1,a+1,2*N-1); } a = (N - 1 - Z - T) % (2*N); b = (N - 1 - Y - T) % (2*N); if(a < 0) a += 2*N; if(b < 0) b += 2*N; if(a <= b){ res += tL.range(a, b); // printf("tL range %d %d\n",a,b); } else { res += tL.range(0,b-1)+tL.range(a+1,2*N-1); // printf("tL range %d %d, %d %d\n",0,b-1,a+1,2*N-1); } a = (N + Y - T) % (2*N); b = (N + Z - T) % (2*N); if(a < 0) a += 2*N; if(b < 0) b += 2*N; if(a <= b){ res += tL.range(a, b); // printf("tL range %d %d\n",a,b); } else { res += tL.range(0,b-1)+tL.range(a+1,2*N-1); // printf("tL range %d %d, %d %d\n",0,b-1,a+1,2*N-1); } writerLn(res); } } return 0; }