#include <iostream>
#include <vector>
#define rep(i,a,n) for(int i=a; i<n; i++)
using namespace std;
typedef long long int ll;
#define int long long int
constexpr int MOD = 1000000007;


template <typename T>
using Matrix = vector< vector<T> >;

template <typename T>
void init_mat(Matrix<T> &A, int h, int w) {
    A.resize(h, vector<T>(w, 0));
}

template <typename T>
Matrix<T> calc_mat(Matrix<T> A, Matrix<T> B) {
    Matrix<T> C(A.size(), vector<T>(B[0].size()));
    for(int i=0; i<A.size(); i++) {
        for(int k=0; k<B.size(); k++) {
            for(int j=0; j<B[0].size(); j++) {
                // C[i][j] += A[i][k] * B[k][j]; // modなし
                C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD; // modあり
            }
        }
    }
    return C;
}

template <typename T>
Matrix<T> mat_pow(Matrix<T> A, ll n) {
    Matrix<T> B(A.size(), vector<T>(A.size()));
    for(int i=0; i<A.size(); i++) B[i][i] = 1;
    while(n > 0) {
        if(n & 1) B = calc_mat(B, A);
        A = calc_mat(A, A);
        n >>= 1;
    }
    return B;
}

void printmat(int p);

static const ll S = 1 << 17;
struct SegTree {
    Matrix<ll> node[2*S], I;
    SegTree() {
        I = { {1, 0, 0, 0}, {0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1} };
        rep(i,0,2*S) {
            node[i] = { {1, 0, 0, 0}, {0, 0, 0, 1}, {0, 0, 0, 1}, {0, 0, 0, 1} };
        }
    }
    void change(int x, Matrix<ll> M) {
        int p = x + (S - 1);
        node[p] = M;
        while(p > 0) {
            int c1 = p, c2 = p + (p % 2 ? 1 : -1);
            if(c1 > c2) swap(c1, c2);
            p = (p - 1) / 2;
            node[p] = calc_mat(node[c2], node[c1]);
        }
    }
    Matrix<ll> query(int a, int b, int l=0, int r=S, int k=0) {
        if(b <= l || r <= a) return I;
        if(a <= l && r <= b) return node[k];
        int mid = (l + r) / 2;
        Matrix<ll> vl = query(a, b, l, mid, 2*k+1);
        Matrix<ll> vr = query(a, b, mid, r, 2*k+2);
        return calc_mat(vr, vl);
    }
};

int N, Q;
SegTree seg;

signed main() {
    cin >> N >> Q;
    rep(x,0,Q) {
        char q; cin >> q;
        if(q == 'x') {
            int i, v; cin >> i >> v;
            Matrix<ll> nmat = seg.node[S+i-1];
            nmat[0][2] = v;
            seg.change(i, nmat);
        }
        if(q == 'y') {
            int i, v; cin >> i >> v;
            Matrix<ll> nmat = seg.node[S+i-1];
            nmat[1][1] = v;
            nmat[2][1] = 2 * v;
            nmat[2][2] = (v * v) % MOD;
            seg.change(i, nmat);
        }
        if(q == 'a') {
            int i; cin >> i;
            Matrix<ll> qmat = seg.query(0, i);
            int ans = 0;
            rep(i,0,4) (ans += qmat[0][i]) %= MOD;
            cout << ans << endl;
        }
    }
    return 0;
}