#include <fstream>
#include <algorithm>
#define N 100010
using namespace std;
typedef long long ll;
ifstream cin("magics.in");
ofstream cout("magics.out");
ll mod=1000000007;
class rangetree
{
public:
	ll seg[4*N];
	ll lazy[4*N];
	void pushdown(int o,int l,int r)
	{
		if(l==r||!lazy[o])return ;
		int lc=o<<1,rc=o<<1|1;
		int mid=(l+r)>>1;
		lazy[lc]+=lazy[o];
		lazy[rc]+=lazy[o];
		seg[lc]+=lazy[o]*(mid-l+1);
		seg[rc]+=lazy[o]*(r-mid);
		lazy[o]=0;
	}
	void pushup(int o)
	{
		seg[o]=seg[o<<1]+seg[o<<1|1];
	}
	void add(int o,int l,int r,int ql,int qr,int val)
	{
		if(ql<=l&&r<=qr)
		{
			lazy[o]+=val;
			seg[o]+=(ll)(r-l+1)*val;
			return ;
		}
		int mid=(l+r)>>1;
		pushdown(o,l,r);
		if(ql<=mid)add(o<<1,l,mid,ql,qr,val);
		if(mid<qr)add(o<<1|1,mid+1,r,ql,qr,val);
		pushup(o);
	}
	ll query(int o,int l,int r,int ql,int qr)
	{
		if(ql<=l&&r<=qr)return seg[o];
		int mid=(l+r)>>1;
		ll ans=0;
		pushdown(o,l,r);
		if(ql<=mid)ans+=query(o<<1,l,mid,ql,qr);
		if(mid<qr)ans+=query(o<<1|1,mid+1,r,ql,qr);
		return ans;
	}
}A;
int n,q;
void read()
{
	cin>>n>>q;
}
void work()
{
	int i,x,y;
	ll ans;
	char S;
	for(i=1;i<=q;i++)
	{
		cin>>S;
		if(S=='C')
		{
			cin>>x>>y;
			A.add(1,1,n,x,y,1);
		}
		if(S=='Q')
		{
			cin>>x;
			ans=A.query(1,1,n,1,x);
			ans%=mod;
			cout<<ans<<endl;
		}
	}
}
int main()
{
	read();
	work();
	return 0;
}