#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;

int main()
{
	cin.sync_with_stdio(false);
	int n, q, ii, vv;
	char c;
	cin >> n >> q;
	vector<ll> a(n + 1, 1), b(n + 1, 1), x(n + 1), y(n + 1);
	while (q--) {
		cin >> c;
		if (c == 'x') {
			cin >> ii >> vv;
			x[ii] = vv;
			for (int i = ii; i < n; i++) {
				a[i + 1] = (x[i] * b[i] % mod * b[i] % mod + a[i]) % mod;
			}
		}
		else if (c == 'y') {
			cin >> ii >> vv;
			y[ii] = vv;
			for (int i = ii; i < n; i++) {
				a[i + 1] = (x[i] * b[i] % mod * b[i] % mod + a[i]) % mod;
				b[i + 1] = (y[i] * b[i] + 1) % mod;
			}
		}
		else {
			cin >> ii;
			printf("%lld\n", a[ii]);
		}
	}
	return 0;
}