#define _CRT_SECURE_NO_WARNINGS //#define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int,int> pii; #define all(c) (c).begin(), (c).end() #define loop(i,a,b) for(ll i=a; i<ll(b); i++) #define rep(i,b) loop(i,0,b) #define pb push_back #define eb emplace_back #define mp make_pair #define mt make_tuple template<class T> istream & operator>>(istream & is, vector<T> &); template<class T> ostream & operator<<(ostream & os, vector<T> const &); template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){} template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); } template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; } template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _it(istream &, tuple<T...> &){} template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _it(istream & is, tuple<T...> & t){ is >> get<n>(t); _it<n+1>(is, t); } template<class...T> istream & operator>>(istream & is, tuple<T...> & t){ _it<0>(is, t); return is; } template<class T, class U> istream & operator<<(istream & is, pair<T,U> & p){ return is >> p.first >> p.second; } template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; } template<class T> istream & operator>>(istream & is, vector<T> & v){ rep(i,v.size()) is >> v[i]; return is; } template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; } #ifdef DEBUG #define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl) #else #define dump(...) #endif // int const B = 1500; // deque<int> baqL[B]; // deque<int> baqR[B]; // int cnt[B]; ll L[30000]; ll R[30000]; int main(){ int N,Q; while(cin>>N>>Q){ memset(L,0,sizeof(L)); memset(R,0,sizeof(R)); rep(_,Q){ // dump(vi(L,L+N)); // dump(vi(R,R+N)); char x; ll y,z; cin >> x >> y >> z; if(x=='R'){ R[y]+=z; } else if(x=='L'){ L[y]+=z; } else { ll ans = 0; loop(i,y,z){ ans += L[i]+R[i]; } cout << ans << endl; } ll t = L[0]; ll u = R[N-1]; rep(i,N-1){ L[i] = L[i+1]; } L[N-1] = u; for(int i=N-2;i>=0;i--){ R[i+1] = R[i]; } R[0] = t; } } }