class segment_tree:
    __slots__ = ["op_M", "e_M","N","N0","dat"]
    def __init__(self, N, operator_M, e_M):
        self.op_M = operator_M
        self.e_M = e_M
        self.N = N
        self.N0 = 1<<(N-1).bit_length()
        self.dat = [self.e_M]*(2*self.N0)
    
    # 長さNの配列 initial で初期化
    def build(self, initial):
        assert self.N == len(initial)
        self.dat[self.N0:self.N0+len(initial)] = initial[:]
        for k in range(self.N0-1,0,-1):
            self.dat[k] = self.op_M(self.dat[2*k], self.dat[2*k+1])

    # a_k の値を x に更新
    def update(self,k,x):
        k += self.N0
        self.dat[k] = x
        k >>= 1
        while k:
            self.dat[k] = self.op_M(self.dat[2*k], self.dat[2*k+1])
            k >>= 1

    # 区間[L,R]をopでまとめる
    def query(self,L,R):
        L += self.N0; R += self.N0 + 1 
        sl = sr = self.e_M
        while L < R:
            if R & 1:
                R -= 1
                sr = self.op_M(self.dat[R],sr)
            if L & 1:
                sl = self.op_M(sl,self.dat[L])
                L += 1
            L >>= 1; R >>= 1
        return self.op_M(sl,sr)

    def get(self, k): #k番目の値を取得。query[k,k]と同じ
        return self.dat[k+self.N0]

n,q = map(int,input().split())
from operator import add
seg = segment_tree(2*n,add,0)
for t in range(1,q+1):
    x,y,z = input().split()
    y,z = int(y),int(z)
    if x=="L":
        idx = (2*n-y-1-t)%(2*n)
        seg.update(idx, seg.get(idx) + z)
    elif x=="R":
        idx = (y-t)%(2*n)
        seg.update(idx, seg.get(idx) + z)
    else:
        v = 0
        L = (y-t)%(2*n)
        R = (z-1-t)%(2*n)
        if L <= R:
            v += seg.query(L,R)
        else:
            v += seg.query(0,R) + seg.query(L,2*n-1)
        R = (2*n-y-1-t)%(2*n)
        L = (2*n-z-t)%(2*n)
        if L <= R:
            v += seg.query(L,R)
        else:
            v += seg.query(0,R) + seg.query(L,2*n-1)
        print(v)