#include <iostream>
#include <algorithm>
using namespace std;

int main(){
	using ll = long long;
	constexpr ll mod = 1e9 + 7;
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, q;
	cin >> n >> q;
	ll a[n + 1], b[n + 1], x[n]{}, y[n]{};
	a[0] = b[0] = 1;
	ll puni = 1;
	while(q--){
		char c;
		cin >> c;
		if(c == 'x'){
			ll i, v;
			cin >> i >> v;
			x[i] = v;
			puni = max(1ll, min(puni, i));
		}
		if(c == 'y'){
			ll i, v;
			cin >> i >> v;
			y[i] = v;
			puni = max(1ll, min(puni, i));
		}
		if(c == 'a'){
			int i;
			cin >> i;
			if(puni <= i){
				for(int j = puni; j <= i; j++){
					a[j] = (x[j - 1] * b[j - 1] % mod * b[j - 1] % mod + a[j - 1]) % mod;
					b[j] = (y[j - 1] * b[j - 1] % mod + 1) % mod;
				}
				puni = n + 1;
			}
			cout << a[i] << endl;
		}
	}
}