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

int n, q, a[100009], b[100009], x[100009], y[100009], mod = 1000000007;
char c[100009]; vector<int>vec;

int main() {
	cin >> n >> q;
	for (int i = 1; i <= q; i++) {
		cin >> c[i];
		if (c[i] == 'x' || c[i] == 'y') {
			cin >> a[i] >> b[i]; vec.push_back(a[i]);
		}
		else cin >> a[i];
	}
	sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());

	for (int i = 1; i <= q; i++) {
		if (c[i] == 'x') x[a[i]] = b[i];
		if (c[i] == 'y') y[a[i]] = b[i];
		if (c[i] == 'a') {
			long long ret = 1, K = 0;
			for (int j = 0; j < vec.size(); j++) {
				if (vec[j] >= a[i]) break;
				if (j == 0 || vec[j] - vec[j - 1] >= 2) K = 1;
				if (x[vec[j]] >= 1) ret += 1LL * (1LL * K * K % mod) * x[vec[j]] % mod;
				K = (1LL * K * y[vec[j]] + 1LL) % mod;
			}
			printf("%lld\n", 1LL * (ret + mod) % mod);
		}
	}
	return 0;
}