import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

//	Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return to!int(readToken); }
long readLong() { return to!long(readToken); }
real readReal() { return to!real(readToken); }

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


int bitN;
long[] bit;

void bitAdd(int pos, long val) {
	for (int x = pos; x <= bitN; x += x & -x) {
		bit[x] += val;
	}
}
long bitSum(int pos) {
	long ret;
	for (int x = pos; x > 0; x &= x - 1) {
		ret += bit[x];
	}
	return ret;
}

int N, Q;

int mod(int x) {
	x %= (N * 2);
	for (; x < 1; x += N * 2) {}
	for (; x > N * 2; x -= N * 2) {}
	return x;
}

void main(string[] args) {
	try {
	for (; ; ) {
		N = readInt;
		Q = readInt;
		bitN = N * 2;
		bit = new long[bitN + 1];
		foreach (q; 0 .. Q) {
			switch (readToken) {
				case "L": {
					const y = readInt;
					const val = readLong;
					const pos = mod((N * 2 - y) - q);
					bitAdd(pos, val);
				} break;
				case "R": {
					const y = readInt;
					const val = readLong;
					const pos = mod((1 + y) - q);
					bitAdd(pos, val);
				} break;
				case "C": {
					const l = readInt;
					const r = readInt - 1;
					long ans;
					foreach (p; [ [ (1 + l) - q, (1 + r) - q ], [ (N * 2 - r) - q, (N * 2 - l) - q ] ]) {
						const shift0 = p[0] / (N * 2);
						foreach (shift; p[0] / (N * 2) - 2 .. p[0] / (N * 2) + 2) {
							int a = p[0] - shift * (N * 2);
							int b = p[1] - shift * (N * 2);
							chmax(a, 1);
							chmin(b, N * 2);
							if (a <= b) {
								ans += bitSum(b) - bitSum(a - 1);
							}
						}
					}
					writeln(ans);
				} break;
				default: assert(false);
			}
		}
break;
debug{
writeln("====");
}
	}
	} catch (EOFException) {}
}