#include <bits/stdc++.h>
using namespace std;

using ll = long long;
ll n, q, i, v, puni, a[100001], b[100001], x[100001], y[100001], mod = 1000000007;
char c;

int main(){
	a[0] = b[0] = 1;
	scanf("%d%d\n", &n, &q);
	for(int muni = 0; muni < q; muni++){
		scanf("%c", &c);
		if(c == 'a'){
			if(puni != 10000000){
				for(int i = puni; i < n; i++){
					a[i + 1] = (x[i] * b[i] % mod * b[i] + a[i]) % mod;
					b[i + 1] = (y[i] * b[i] + 1) % mod;
				}
				puni = 10000000;
			}
			scanf("%d\n", &i);
			printf("%lld\n", a[i]);
		}else{
			scanf("%d %d\n", &i, &v);
			if(c == 'x') x[i] = v;
			else y[i] = v;
			puni = min(puni, i);
		}
	}
}