import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


class fenwick_tree(object):
    def __init__(self, n):
        self.n = n
        self.log = n.bit_length()
        self.data = [0] * n

    def __sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def add(self, p, x):
        """ a[p] += xを行う"""
        p += 1
        while p <= self.n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        """a[l] + a[l+1] + .. + a[r-1]を返す"""
        return self.__sum(r) - self.__sum(l)

    def lower_bound(self, x):
        """a[0] + a[1] + .. a[i] >= x となる最小のiを返す"""
        if x <= 0:
            return -1
        i = 0
        k = 1 << self.log
        while k:
            if i + k <= self.n and self.data[i + k - 1] < x:
                x -= self.data[i + k - 1]
                i += k
            k >>= 1
        return i


N, Q = map(int, input().split())
bit = fenwick_tree(2 * N)
ans = []

for time in range(Q):
    X, Y, Z = input().rstrip().split()
    if X == "L":
        Y = (int(Y) + time) % (2 * N)
        bit.add(Y, int(Z))
    elif X == "R":
        Y = (2 * N - int(Y) - 1 + time) % (2 * N)
        bit.add(Y, int(Z))
    else:
        cnt = 0
        L = (int(Y) + time) % (2 * N)
        R = (int(Z) + time - 1) % (2 * N)
        if L <= R:
            cnt += bit.sum(L, R + 1)
        else:
            cnt += bit.sum(0, R + 1) + bit.sum(L, 2 * N)
        L = (2 * N - int(Z) + time) % (2 * N)
        R = (2 * N - int(Y) - 1 + time) % (2 * N)
        if L <= R:
            cnt += bit.sum(L, R + 1)
        else:
            cnt += bit.sum(0, R + 1) + bit.sum(L, 2 * N)
        ans.append(cnt)

print(*ans, sep="\n")