#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <array>
#include <climits>
#include <bitset>
#include <cassert>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;

int n, nn, l;

const int N = 1e5;

template<class T>
struct BIT{
	vector<T> dat;
	int n;

	BIT(int _n){
		n = _n + 10;
		dat.resize(n);
	}

	void add(int x, T val){
		for (int i = ++x; i < n; i += i&-i) dat[i] += val;
	}
	T sum(int a){
		return sum(0, a);
	}
	T sum(int a, int b){
		if (a != 0) return sum(0, b) - sum(0, a);
		T res = 0;
		for (int i = b; i > 0; i -= i&-i) res += dat[i];
		return res;
	}
};

BIT<ll> cnt(N);

void L(int y, int z){
	cnt.add((l + nn - y - 1) % nn, z);
}

void R(int y, int z){
	cnt.add((l + y) % nn, z);
}

ll get(int l, int r){
	if (l >= nn) return get(l - nn, r - nn);
	if (r <= nn) return cnt.sum(l, r);
	return get(l, nn) + get(0, r%nn);
}

// [l+y, l+z)
// (l+nn-z, l+nn-y]
ll count(int y, int z){
	ll a = get(l + y, l + z);
	ll b = get(l + nn - z, l + nn - y);
	return a + b;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout.setf(ios::fixed);
	cout.precision(20);

	int n, q;
	cin >> n >> q;
	nn = n * 2;

	int cnt[N] = {};

	while (q--){
		l = (l - 1 + nn) % nn;
		char x;
		int y, z;
		cin >> x >> y >> z;
		if (x == 'L') L(y, z);
		else if (x == 'R') R(y, z);
		else{
			cout << count(y, z) << '\n';
		}

		//int cnt[N] = {};
		//for (int i = 0; i < n; ++i){
		//	cnt[i] += count(i, i + 1);
		//	cout << cnt[i] << ' ';
		//}
		//cout << endl;
	}
}