#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

struct SegTree{
  typedef ll T;
  T e = 0;
  T m(const T&a, const T&b){return a + b;}
//###################################################
  typedef int i;i n;vector<T> d;
  void init(i m){n=1<<(32-__builtin_clz(m-1));d.resize(2*n-1);FOR(j,0,2*n-1)d[j]=e;}
  void init(vector<T>&v){n=1<<(32-__builtin_clz(sz(v)-1));d.resize(2*n-1);FOR(j,0,sz(v))d[j+n-1]=v[j];FORR(k, n-2, 0)d[k]=m(d[k*2+1],d[k*2+2]);}
  void update(i k,T a){k+=n-1;d[k]=a;while(k>0){k=(k-1)/2;d[k]=m(d[k*2+1],d[k*2+2]);}}
  T q(i a,i b,i k,i l,i r){return (r<=a||b<=l)?e:(a<=l&&r<=b)?d[k]:m(q(a,b,k*2+1,l,(l+r)/2),q(a,b,k*2+2,(l+r)/2,r));}
  T query(i a,i b){return q(a,b,0,0,n);}
};
ll n, q, x, y, _x, _y;
char c;

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> n >> q;
  n *= 2;
  SegTree segl, segr;
  segl.init(n+1);
  segr.init(n+1);
  FOR(t, 1, q+1){
    cin >> c >> x >> y;
    switch(c){
      case 'L':
        _x = (x + t) % n;
        segl.update(_x, segl.query(_x, _x+1) + y);
        _x = (n-1 - x - t) % n;
        if(_x < 0) _x += n;
        segr.update(_x, segr.query(_x, _x+1) + y);
        break;
      case 'R':
        _x = (n-1 - x + t) % n;
        if(_x < 0) _x += n;
        segl.update(_x, segl.query(_x, _x+1) + y);
        _x = (x - t) % n;
        if(_x < 0) _x += n;
        segr.update(_x, segr.query(_x, _x+1) + y);
        break;
      case 'C':
        ll ans = 0;
        y--;
        _x = (x + t) % n;
        _y = (y + t) % n;
        if(_x <= _y){
          ans += segl.query(_x, _y+1);
        }else{
          ans += segl.query(_x, n);
          ans += segl.query(0, _y+1);
        }

        _x = (x - t) % n; if(_x < 0) _x += n;
        _y = (y - t) % n; if(_y < 0) _y += n;
        if(_x <= _y){
          ans += segr.query(_x, _y+1);
        }else{
          ans += segr.query(_x, n);
          ans += segr.query(0, _y+1);
        }
        cout << ans << endl;
        break;
    }
  }
  return 0;
}