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

const long MOD = 1000000000 + 7;

vector<long>x(1000000);
vector<long>y(1000000);
long calB(int idx)
{
  if (idx <= 0) {
    return 1;
  }
  if (y[idx - 1] == 0) {
    return 1;
  } else {
    return (((y[idx - 1] * calB(idx - 1)) % MOD) + 1) % MOD;
  }
}
long calA(int idx)
{
  if (idx <= 0) {
    return 1;
  }
  if (x[idx - 1] == 0) {
    return calA(idx - 1);
  } else {
    long v = calB(idx - 1);
    return (((x[idx - 1] * ((v * v) % MOD) % MOD) + calA(idx - 1)) % MOD);
  }
}


int main()
{
 int n, q;
 cin >> n >> q;
 for (int t = 0; t < q; ++t) {
   char c;
   cin >> c;
   switch (c) {
     case 'x': {
       int idx, val;
       cin >> idx >> val;
       x[idx] = val;
     }
     break;
     case 'y': {
       int idx, val;
       cin >> idx >> val;
       y[idx] = val;
     }
     break;
     case 'a': {
       int idx;
       cin >> idx;
       cout << calA(idx) << endl;
     }
   }
 }
  return 0;
}