#include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
const ll MOD=1000000007;
unsigned int a[100001],b[100001],x[100001],y[100001];
int main(){
	a[0]=b[0]=1;
	int n,q,p,v;
	char c;
	int f=0;
	scanf("%d%d\n",&n,&q);
	
	for(int k=0;k<q;k++){
		scanf("%c",&c);
		if(c=='a'){
			if(f!=1000000){
				for(int i=f;i<n;i++){
					b[i+1]=(1ULL*y[i]*b[i]+1)%MOD;
					a[i+1]=((1ULL*x[i]*b[i])%MOD*b[i]+a[i])%MOD;
				}
				f=1000000;		
			}
			scanf("%d\n",&p);
			printf("%d\n",a[p]);
		}
		else
		{
			scanf("%d %d\n",&p,&v);
			if(c=='x')x[p]=v;
			else y[p]=v;
			f=min(f,p);
		}
	}

}