/*
  reffered to sugim48's code (http://yukicoder.me/submissions/12211)
 */

#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
int N,Q;
#define MAX_N ((1<<18)-1)
class BIT_{
public:
  ll BIT[MAX_N],n;
  void bit_init(int n_){
    n = 1;
    while(n < n_){
      n *= 2;
    }
    for(int i = 0; i < 2 * n-1;i++){
      BIT[i] = 0;
    }
  }

  ll sum(int i){
    ll s = 0;
    while(i > 0){
      s += BIT[i];
      i -= (i & -i);
    }
    return s;
  }
  ll sum(int i, int j) {
    return sum(j) - sum(i);
  }
  void add(int i,int x){
    i += 1;
    while(i <= n){
      BIT[i] += x;
      i += (i & -i);
    }
  }
};

BIT_ bitR, bitL;

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N >> Q;
  const int L = 50000;
  bitR.bit_init(L);// <-
  bitL.bit_init(L);// ->
  int xl = 0;
  int xr = 25000;
  for (int t = 1; t <= Q; t++) {
    char c;
    int x,y;
    cin >> c >> x >> y;
    if (c == 'L') {
      bitL.add(xl+x,y);
    }else if(c == 'R'){
      bitR.add(xr+x,y);
    }else{
      ll ret = 0;
      ret += bitL.sum(xl+x,xl+y);
      ret += bitR.sum(xr+x,xr+y);
      cout << ret << endl;
    }
    bitR.add(xr-1,bitL.sum(xl,xl+1));
    bitL.add(xl+N,bitR.sum(xr + N-1,xr+N));
    xl++;
    xr--;
  }
  return 0;
}