#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__ << ")"

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 * NlogN)
class Main{
	public:
	void run(){
		int N,Q;cin >> N >> Q;

		Fenwick<ll> fenL(N),fenR(N);
		REP(q,Q){
			char x;ll y,z;cin >> x >> y >> z;
			if(x=='L')fenL.add(y,z);
			if(x=='R')fenR.add(y,z);
			if(x=='C'){
				cout << fenL.sum(y,z) + fenR.sum(y,z)<<endl;
			}

			//shift
			ll lv=fenL.sum(0,1);fenL.add(0,-lv);
			for(int i=1;i<N;i++){
				ll v=fenL.sum(i,i+1);fenL.add(i-1,v);fenL.add(i,-v);
			}
			//shift
			ll rv=fenR.sum(N-1,N);fenR.add(N-1,-rv);
			for(int i=N-2;i>=0;i--){
				ll v=fenR.sum(i,i+1);fenR.add(i+1,v);fenR.add(i,-v);
			}
			fenR.add(0,lv);fenL.add(N-1,rv);
		}
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}