#include <cstdio>
#define ls(x) x << 1
#define rs(x) x << 1 | 1
typedef long long ll;

const int MAXN = 1e5 + 10;
const ll MOD = 1e9 + 7;

ll tree[MAXN << 2], lazy[MAXN << 2];

void PushDown(int root, int lt, int rt) {
	if (lazy[root]) {
		int mid = lt + ((rt - lt) >> 1);
		(tree[ls(root)] += (mid - lt + 1) * 1ll * lazy[root]) %= MOD;
		(lazy[ls(root)] += lazy[root]) %= MOD;
		(tree[rs(root)] += (rt - mid) * 1ll * lazy[root]) %= MOD;
		(lazy[rs(root)] += lazy[root]) %= MOD;
		lazy[root] = 0;
	}
	return ;
}

void PushUp(int root) {
  tree[root] = (tree[ls(root)] + tree[rs(root)]) % MOD;
}

void AddSeq(int root, int lt, int rt, int lq, int rq, int val) {
	if (lt == lq && rt == rq) {
		(tree[root] += (rt - lt + 1) * 1ll * val) %= MOD;
		(lazy[root] += val) %= MOD;
		return ;
	}
	PushDown(root, lt, rt);
	int mid = lt + ((rt - lt) >> 1);
	if (rq <= mid) {
		AddSeq(ls(root), lt, mid, lq, rq, val);
	} else if (lq > mid) {
		AddSeq(rs(root), mid + 1, rt, lq, rq, val);
	} else {
		AddSeq(ls(root), lt, mid, lq, mid, val);
		AddSeq(rs(root), mid + 1, rt, mid + 1, rq, val);
	}
	PushUp(root);
	return ;
}

ll GetSeq(int root, int lt, int rt, int lq, int rq) {
	if (lt == lq && rt == rq) {
		return tree[root];
	}
	PushDown(root, lt, rt);
	int mid = lt + ((rt - lt) >> 1);
	if (rq <= mid) {
		return GetSeq(ls(root), lt, mid, lq, rq);
	} else if (lq > mid) {
		return GetSeq(rs(root), mid + 1, rt, lq, rq);
	} else {
		return GetSeq(ls(root), lt, mid, lq, mid) + GetSeq(rs(root), mid + 1, rt, mid + 1, rq);
	}
}

int n, m;


int main() {
  freopen("magics.in", "r", stdin);
  freopen("magics.out", "w", stdout);
  scanf("%d %d", &n, &m);
  n++;
  while (m--) {
    char op[10];
    scanf("%s", op);
    if (op[0] == 'C') {
      int l, r;
      scanf("%d %d", &l, &r);
      AddSeq(1, 1, n, l, r, 1);
      AddSeq(1, 1, n, r + 1, r + 1, -(r - l + 1));
    } else {
      int x;
      scanf("%d", &x);
      printf("%lld\n", GetSeq(1, 1, n, 1, x));
    }
  }
  return 0;
}