#include <iostream>
using namespace std;
const long long maxn = 100010;
const long long p = 1000000007;
long long sum[maxn << 2], lazy1[maxn << 2], lazy2[maxn << 2];
long long t;
void Pushup(long long n) {
    sum[n] = sum[n << 1] + sum[n << 1 | 1];
    sum[n] %= p;
}

void add(long long n, long long l, long long r, long long v1, long long v2)
{
    sum[n] += (r - l + 1) * v1 + (1 + (r - l + 1)) * (r - l + 1) / 2 * v2;
    lazy1[n] += v1;
    lazy2[n] += v2;
    sum[n] %= p;
    lazy1[n] %= p;
    lazy2[n] %= p;
}

void pushdown(long long l, long long r, long long n) {
    {
        long long m = (l + r) >> 1;
        add(n << 1, l, m, lazy1[n], lazy2[n]);
        add(n << 1 | 1, m + 1, r, (lazy1[n] + (m - l + 1) * lazy2[n]) % p, lazy2[n]);
        lazy1[n] = 0;
        lazy2[n] = 0;
    }
}

void update(long long L, int R, long long l = 1, long long r = t, long long n = 1) {
    if (L <= l && r <= R) {
        add(n, l, r, (l - L)%p, 1);
        return;
    }
    pushdown(l, r, n);
    long long m = (l + r) >> 1;
    if (L <= m) update(L, R, l, m, n << 1);
    if (m < R) update(L, R, m + 1, r, n << 1 | 1);
    Pushup(n);
}

long long query(long long L, long long R, long long l = 1, long long r = t, long long n = 1) {
    if (L <= l && r <= R) {
        return sum[n];
    }
    pushdown(l, r, n);
    long long res = 0;
    long long m = (l + r) >> 1;
    if (L <= m) res += query(L, R, l, m, n << 1);
    if (m < R) res += query(L, R, m + 1, r, n << 1 | 1);
    return res;
}
int main()
{
    freopen("magics.in","r",stdin);
    freopen("magics.out","w",stdout);
    
    long long x;
    cin >> t >> x;
    while (x--)
    {
        long long L, R;
        char q;
        cin >> q;
        if (q == 'C')
        {
            cin >> L >> R;
            update(L, R);
        }
        else
        {
            cin >> L;
            cout << query(L, L) << endl;
        }
    }
    return 0;
}