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

const long MOD = 1000000000 + 7;

int main()
{
 int n, q;
 cin >> n >> q;
 vector<long>x(n);
 vector<long>y(n);
 vector<long>a(n + 1);
 vector<long>b(n + 1);
 a[0] = 1;
 b[0] = 1;
 for (int i = 0; i < n; ++i) {
   a[i + 1] = (x[i] * ((b[i] * b[i]) % MOD) % MOD) + a[i];
   b[i + 1] = y[i] * b[i] + 1;
   a[i + 1] %= MOD;
   b[i + 1] %= MOD;
 }
 for (int t = 0; t < q; ++t) {
   char c;
   cin >> c;
   switch (c) {
     case 'x': {
       int idx, val;
       cin >> idx >> val;
       x[idx] = val;
       for (int i = idx; i < n; ++i) {
         a[i + 1] = (x[i] * ((b[i] * b[i]) % MOD) % MOD) + a[i];
         a[i + 1] %= MOD;
       }
     }
     break;
     case 'y': {
       int idx, val;
       cin >> idx >> val;
       y[idx] = val;
       for (int i = idx; i < n; ++i) {
         a[i + 1] = (x[i] * ((b[i] * b[i]) % MOD) % MOD) + a[i];
         b[i + 1] = y[i] * b[i] + 1;
         a[i + 1] %= MOD;
         b[i + 1] %= MOD;
       }
     }
     break;
     case 'a': {
       int idx;
       cin >> idx;
       cout << a[idx] << endl;
     }
   }
 }
  return 0;
}