package q3xx; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q396 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), Q = ni(); long[] ft = new long[2*n+1]; long all = 0; for(int i = 0;i < Q;i++){ char type = nc(); int t = ni(), y = ni(), z = ni(); if(type == 'R'){ int x = (y-t)%(2*n); if(x < 0)x += 2*n; addFenwick(ft, x, z); all += z; }else if(type == 'L'){ int x = (2*n-1-y-t)%(2*n); if(x < 0)x += 2*n; addFenwick(ft, x, z); all += z; }else{ long ret = 0; { int L = (y-t)%(2*n); int R = (z-t)%(2*n); if(L < 0)L += 2*n; if(R < 0)R += 2*n; ret += sumFenwick(ft, R-1); ret -= sumFenwick(ft, L-1); if(L < R){ }else{ ret += all; } } { int L = (2*n-1-z-t+1)%(2*n); int R = (2*n-1-y-t+1)%(2*n); if(L < 0)L += 2*n; if(R < 0)R += 2*n; ret += sumFenwick(ft, R-1); ret -= sumFenwick(ft, L-1); if(L < R){ }else{ ret += all; } } out.println(ret); } } } public static long sumFenwick(long[] ft, int i) { long sum = 0; for(i++;i > 0;i -= i&-i)sum += ft[i]; return sum; } public static void addFenwick(long[] ft, int i, long v) { if(v == 0)return; int n = ft.length; for(i++;i < n;i += i&-i)ft[i] += v; } public static long[] restoreFenwick(long[] ft) { int n = ft.length-1; long[] ret = new long[n]; for(int i = 0;i < n;i++)ret[i] = sumFenwick(ft, i); for(int i = n-1;i >= 1;i--)ret[i] -= ret[i-1]; return ret; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q396().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }