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

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

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(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) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


void add(long[] bit, int pos, long val) {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}
long sum(long[] bit, int pos) {
  long ret;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}

int N, Q;
string[] X;
int[] T, Y, Z;

int mod(int a) {
  return ((a %= (2 * N)) < 0) ? (a + 2 * N) : a;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      Q = readInt();
      X = new string[Q];
      T = new int[Q];
      Y = new int[Q];
      Z = new int[Q];
      foreach (q; 0 .. Q) {
        X[q] = readToken();
        T[q] = readInt();
        Y[q] = readInt();
        Z[q] = readInt();
      }
      auto bit = new long[2 * N];
      foreach (q; 0 .. Q) {
        switch (X[q]) {
          case "L": {
            bit.add(mod((2 * N - 1 - Y[q]) - T[q]), Z[q]);
          } break;
          case "R": {
            bit.add(mod(Y[q] - T[q]), Z[q]);
          } break;
          case "C": {
            --Z[q];
            long ans;
            foreach (p; [
              [mod(Y[q] - T[q]), mod(Z[q] - T[q] + 1)],
              [mod((2 * N - 1 - Z[q]) - T[q]), mod((2 * N - 1 - Y[q]) - T[q] + 1)]
            ]) {
              ans -= bit.sum(p[0]);
              ans += bit.sum(p[1]);
              if (p[0] > p[1]) {
                ans += bit.sum(2 * N);
              }
            }
            writeln(ans);
          } break;
          default: assert(false);
        }
      }
    }
  } catch (EOFException e) {
  }
}