#include<cstdio>


typedef long long ll;


ll a[100000+1], b[100000+1], x[100000+1], y[100000+1];
int last_update;


ll m(ll v)
{
	return v%1000000007;
}


void min_u(int &m, int v)
{
	if(m>v) m=v;
}


void max_u(int &m, int v)
{
	if(m<v) m=v;
}


void solve(int i)
{
	int j;

	for(j=last_update;j<i;j++)
	{
		a[j+1]=m(m(x[j]*b[j])*b[j]+a[j]);
		b[j+1]=m(y[j]*b[j]+1);
	}
	max_u(last_update, i);
	printf("%lld\n", a[i]);
}


int main(void)
{
	char oneline[100], t;
	int i, j, v, n, q;

	scanf("%d%d\n", &n, &q);
	last_update=0;
	for(j=0;j<q;j++)
	{
		a[0]=b[0]=1;

		fgets(oneline, sizeof(oneline), stdin);
		sscanf(oneline, "%c%d%d", &t, &i, &v);
		if(t=='x')
		{
			x[i]=v;
			min_u(last_update, i);
		}
		if(t=='y')
		{
			y[i]=v;
			min_u(last_update, i);
		}
		if(t=='a')
		{
			solve(i);
		}
	}

	return 0;
}