#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N, Q;
vs X;
vi Y, Z;

void init(){
  cin >> N >> Q;
  X = vs( Q );
  Y = Z = vi( Q );
  for( int i = 0; i < Q; ++i ){
    cin >> X[ i ] >> Y[ i ] >> Z[ i ];
  }
}

struct fenwick{
  vi dat;
  fenwick( int sz ){
    dat = vi( sz );
  }
  void add( int x, int v ){
    for( int i = x; i < dat.size(); i += i & -i ){
      dat[ i ] += v;
    }
  }
  int sum( int x ){
    int res = 0;
    for( int i = x; i > 0; i -= i & -i ){
      res += dat[ i ];
    }
    return res;
  }
} *to_left, *to_right;

void preprocess(){
  const int origin = 2 * ( N + Q );
  to_left = new fenwick( 5 * ( N + Q ) );
  to_right = new fenwick( 5 * ( N + Q ) );
  for( int i = 0; i < Q; ++i ){
    int to_left_lb = origin + i;
    int to_left_rb = origin + N - 1 + i;
    int to_right_lb = origin - i;
    int to_right_rb = origin + N - 1 - i;
    if( to_left->sum( to_left_lb - 1 ) - to_left->sum( to_left_lb - 2 ) ){
      to_right->add( to_right_lb, to_left->sum( to_left_lb - 1 ) - to_left->sum( to_left_lb - 2 ) );
    }
    if( to_right->sum( to_right_rb + 1 ) - to_right->sum( to_right_rb ) ){
      to_left->add( to_left_rb, to_right->sum( to_right_rb + 1 ) - to_right->sum( to_right_rb ) );
    }
    if( X[ i ] == "R" ){
      to_right->add( Y[ i ] + to_right_lb, Z[ i ] );
    } else if( X[ i ] == "L" ){
      to_left->add( Y[ i ] + to_left_lb, Z[ i ] );
    } else{ // X[ i ] == "C"
      cout << to_left->sum( Z[ i ] - 1 + to_left_lb ) - to_left->sum( Y[ i ] - 1 + to_left_lb )
            + to_right->sum( Z[ i ] - 1 + to_right_lb ) - to_right->sum( Y[ i ] - 1 + to_right_lb ) << endl;
    }
  }
}

void solve(){

}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}