using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Diagnostics;
using System.Collections.Generic;
using System.Text.RegularExpressions;
using Enu = System.Linq.Enumerable;

class Program
{
    static readonly int MaxNQ = (int)2e4;

    void Solve()
    {
        int N = reader.Int(), NQ = reader.Int();
        var L = new BinaryIndexedTree(MaxNQ * 2 + 10);
        var R = new BinaryIndexedTree(MaxNQ * 2 + 10);
        int Lbase = 1, Rbase = MaxNQ + 5;

        for (int qi = 0; qi < NQ; qi++)
        {
            var q = reader.String();
            int a = reader.Int(), b = reader.Int();

            if (q == "L")
                L.Add(Lbase + a, b);
            else if (q == "R")
                R.Add(Rbase + a, b);
            else
                Console.WriteLine(L.Sum(Lbase + --b) - L.Sum(Lbase + --a) + R.Sum(Rbase + b) - R.Sum(Rbase + a));

            R.Add(Rbase - 1, L.Sum(Lbase) - L.Sum(Lbase - 1));
            L.Add(Lbase + N, R.Sum(Rbase + N - 1) - R.Sum(Rbase + N - 2));
            Lbase++;
            Rbase--;
        }
    }


    class BinaryIndexedTree
    {
        private readonly int N;
        private readonly long[] A;

        public BinaryIndexedTree(int N)
        {
            this.N = N;
            A = new long[N + 1];
        }
        public void Add(int i, long val)
        {
            while (i <= N) { A[i] += val; i += i & -i; }
        }
        public long Sum(int i)
        {
            long sum = 0;
            while (i > 0) { sum += A[i]; i &= i - 1; }
            return sum;
        }
    }




    Reader reader = new Reader(Console.In);
    static void Main() { new Program().Solve(); }
}

class Reader
{
    private readonly TextReader reader;
    private readonly char[] separator = { ' ' };
    private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries;
    private string[] A = new string[0];
    private int i;

    public Reader(TextReader r) { reader = r; }
    public bool HasNext() { return Enqueue(); }
    public string String() { return Dequeue(); }
    public int Int() { return int.Parse(Dequeue()); }
    public long Long() { return long.Parse(Dequeue()); }
    public double Double() { return double.Parse(Dequeue()); }
    public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); }
    public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public string Line() { return reader.ReadLine().Trim(); }
    private string[] Split(string s) { return s.Split(separator, removeOp); }
    private bool Enqueue()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return Enqueue();
        A = Split(line);
        i = 0;
        return true;
    }
    private string Dequeue() { Enqueue(); return A[i++]; }
}