/* -*- coding: utf-8 -*-
 *
 * 151.cc: No.151 セグメントフィッシング - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 20000;
const int MAX_Q = 20000;
const int MAX_E2 = 1 << 17;

/* typedef */

typedef long long ll;

template <typename T, const int MAX_E2>
struct SegTreeSum {
  int n, e2;
  T nodes[MAX_E2];

  SegTreeSum() {}

  void init(int _n) {
    n = _n;
    for (e2 = 1; e2 < n; e2 <<= 1);
    //for (int i = 0; i < MAX_E2; i++) nodes[i] = INF;
  }

  T get(int i) { return nodes[e2 - 1 + i]; }

  void add(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] += v;
    j = (j - 1) / 2;

    for (;;) {
      int j0 = j * 2 + 1, j1 = j0 + 1;
      nodes[j] = nodes[j0] + nodes[j1];
      if (j == 0) break;
      j = (j - 1) / 2;
    }
  }

  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return 0;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);

    return v0 + v1;
  }

  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};

/* global variables */

SegTreeSum<ll,MAX_E2> stl, str;

/* subroutines */

/* main */

int main() {
  int n, q;
  cin >> n >> q;

  stl.init(n + q + 2);
  str.init(n + q + 2);
  int tl = 0, tr = q;

  while (q--) {
    char x;
    int y, z;
    cin >> x >> y >> z;

    tl++, tr--;
    ll gl = stl.get(tl - 1);
    ll gr = str.get(tr + n);
    if (gl > 0) str.add(tr, gl);
    if (gr > 0) stl.add(tl + n - 1, gr);

    switch (x) {
    case 'L':
      stl.add(tl + y, z);
      break;
    case 'R':
      str.add(tr + y, z);
      break;
    case 'C':
      ll sum = stl.sum_range(tl + y, tl + z) + str.sum_range(tr + y, tr + z);
      printf("%lld\n", sum);
      break;
    }
  }
  return 0;
}