#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, Q = map(int, readline().split())
X, Y, Z = zip(*[line.split() for line in readlines()])
Y = map(int, Y)
Z = map(int, Z)


class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)

    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data

    def __repr__(self):
        return self.data.__repr__()

    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        data = self.data
        size = self.size
        while i < size:
            data[i] += x
            i += i & -i

    def find_kth_element(self, k):
        data = self.data
        size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1


bit = BinaryIndexedTree([0] * (N + N + N + N + 10))
for t, (x, y, z) in enumerate(zip(X, Y, Z)):
    if x == b'L':
        n = N + N - 1 - y
        n -= t
        n %= (N + N)
        bit.add(n + 1, z)
        bit.add(n + N + N + 1, z)
    elif x == b'R':
        n = y - t
        n %= (N + N)
        bit.add(n + 1, z)
        bit.add(n + N + N + 1, z)
    elif x == b'C':
        cnt = 0
        z -= 1
        for y1, z1 in ((y, z), (N + N - 1 - z, N + N - 1 - y)):
            y1 -= t
            z1 -= t
            q = y1 // (N + N)
            y1 -= q * (N + N)
            z1 -= q * (N + N)
            cnt += bit.get_sum(z1 + 1) - bit.get_sum(y1)
        print(cnt)