import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

class BitSum:
    def __init__(self, n):
        self.n = n+1
        self.table = [0]*self.n
        self.aa = [0]*n

    def __getitem__(self, item):
        return self.aa[item]

    def add(self, i, x):
        self.aa[i] += x
        i += 1
        while i < self.n:
            self.table[i] += x
            i += i & -i

    def sum(self, i):
        i += 1
        res = 0
        while i > 0:
            res += self.table[i]
            i -= i & -i
        return res

    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r-1)
        return self.sum(r-1)-self.sum(l-1)

    # sum(i)>=x となる最小のiを返す
    # xが大きすぎるときは配列の長さnを返す
    def bisect(self, x):
        idx = 0
        d = 1 << (self.n-1).bit_length()-1
        while d:
            if idx+d < self.n and self.table[idx+d] < x:
                x -= self.table[idx+d]
                idx |= d
            d >>= 1
        return idx

def f(l, r):
    if l > r: return bit.sum(n2-1)-bit.sumlr(r, l)
    return bit.sumlr(l, r)

n, q = LI()
n2 = n*2
bit = BitSum(n2)
for t in range(q):
    x, *yz = SI().split()
    if x == "L":
        i, z = yz
        i = (n2-1-int(i)-t)%n2
        z = int(z)
        bit.add(i, z)
    if x == "R":
        i, z = yz
        i = (int(i)-t)%n2
        z = int(z)
        bit.add(i, z)
    if x == "C":
        l, r = yz
        l = int(l)
        r = int(r)
        ans = f((l-t)%n2, (r-t)%n2)
        l, r = n2-r, n2-l
        ans += f((l-t)%n2, (r-t)%n2)
        print(ans)