import java.io.*; import java.math.*; import java.util.*; import static java.util.Arrays.*; public class Main { private static final int mod = (int)1e9+7; final Random random = new Random(0); final IOFast io = new IOFast(); /// MAIN CODE public void run() throws IOException { // int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim()); int TEST_CASE = 1; while(TEST_CASE-- != 0) { n = io.nextInt(); int q = io.nextInt(); bit = new BIT[]{new BIT(n), new BIT(n)}; for(int i = 0; i < q; i++) { char x = io.nextChar(); int t = io.nextInt(); int y = io.nextInt(); int z = io.nextInt(); if(x == 'C') { long ans = 0; ans += cnt(pos(1, t, y), pos(1, t, z - 1)); ans += cnt(pos(0, t, z - 1), pos(0, t, y)); io.out.println(ans); } else { int p = pos(x == 'L' ? 0 : 1, t, y); int d = p%2; p /= 2; bit[d].add(p + 1, z); // System.err.println(p); } } } } int n; BIT[] bit; long cnt(int p1, int p2) { int d1 = p1%2; int d2 = p2%2; p1 /= 2; p2 /= 2; int l, r; // System.err.println(p1 + " " + p2 + " " + d1 + " " + d2); if(d1 == d2) { if(d1 == 1 && p1 > p2 || d1 == 0 && p1 < p2) { return bit[d1].sum(n); } else { throw new RuntimeException(); // l = Math.min(p1, p2); // r = Math.max(p1, p2); // return bit[d1].sum(l, r + 1); } } else { long ans = 0; if(d1 == 1) { l = Math.min(p1, p2); r = n - 1; ans += bit[d1].sum(p1, n); ans += bit[d2].sum(p2, n); } else { l = 0; r = Math.max(p1, p2); ans += bit[d1].sum(0, p1); ans += bit[d2].sum(0, p2); } return ans; } // System.err.println(p1 + " " + p2 + " " + d1 + " " + d2 + " " + l + " " + r + " " + bit.sum(l, r + 1)); // return bit.sum(l, r + 1); } int pos(int d, int t, int x) { int p = t % (2 * n); if(d == 0) { x += p; } else { x -= p; } while(true) { if(x < 0) { d = 0; x = -x - 1; } else if(x >= n) { d = 1; x = n - 1 - (x - n); } else break; } // System.err.println("pos: " + d + " " + t + " " + x); return x * 2 + d; } static class BIT { final int n; final long[] bit; public BIT(int size) { n = size; bit = new long[n + 1]; } // [i, j) public int sum(int i, int j) { return sum(j) - sum(i); } public int sum(int i) { int res = 0; for (; i > 0; i -= i & -i) { res += bit[i]; // while(res >= mod) res -= mod; } return res; } // 1<=i<=n public void add(int i, long x) { if(i == 0) throw new RuntimeException(); for (; i <= n; i += i & -i) { bit[i] += x; // while(bit[i] >= mod) bit[i] -= mod; } } } /// TEMPLATE static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); } static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); } static void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; } static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; } void main() throws IOException { // IOFast.setFileIO("rle-size.in", "rle-size.out"); try { run(); } catch (EndOfFileRuntimeException e) { } io.out.flush(); } public static void main(String[] args) throws IOException { new Main().main(); } static class EndOfFileRuntimeException extends RuntimeException { private static final long serialVersionUID = -8565341110209207657L; } static public class IOFast { private BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); private PrintWriter out = new PrintWriter(System.out); void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); } void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); } void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); } private static int pos, readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500*8*2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; } public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } } int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); } public String nextString() throws IOException { return new String(next()); } public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; } public double nextDouble() throws IOException { return Double.parseDouble(nextString()); } public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; } public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; } public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }