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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<ll> vecll;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= (ll)a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T, class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} 
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<char c = ' ',class T> void write(T a){cout << setprecision(12) << a << endl;}
template<char c = ' ',class T,class ...Args> void write(T a, Args... args){cout << setprecision(12) << a << c; write<c>(args...);}
template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

typedef unsigned long long Num;
#define MOD 1000000007ULL	//！！！！！！！MODが大きい場合、"*="を書き換えること！

struct Matrix {
	vector<vector<Num> > v, w;
	Matrix():v(4, vector<Num>(4)) {}
	Matrix(int n, int m): v(n, vector<Num>(m)) { assert(n > 0 && m > 0); }
	inline int height() const { return (int)v.size(); }
	inline int width() const { return (int)v[0].size(); }
	inline Num& at(int i, int j) { assert(0 <= i && i < height() && 0 <= j && j < width()); return v[i][j]; }
	inline const Num& at(int i, int j) const { assert(0 <= i && i < height() && 0 <= j && j < width()); return v[i][j]; }
	static Matrix identity(int n) {
		Matrix A(n, n);
		rep(i, n) A.at(i, i) = 1;
		return A;
	}
    
	inline static Matrix identity(const Matrix& A) {
		assert(A.height() == A.width()); return identity(A.height()); }
    Matrix operator*(const Matrix& B) const{
        Matrix A(*this);
        return A*=B;
    }
	Matrix& operator*=(const Matrix& B) {
		int n = height(), m = B.width(), p = B.height();
		assert(p == width());
		w.resize(n, vector<Num>(m, 0));
		rep(i, n) rep(j, m) {
			//MOD = 1000000007の場合、1000000012000000036となり、
			//2^64にオーバーフローするのは2^64-1-1000000006^2くらいで、それは最上位4bitが立っているから
			//！MODが違う場合、書き換えること！
			Num x = 0;
			rep(k, p) {
				x += at(i, k) * B.at(k, j);
				if((x >> 60) == 0xf) x %= MOD;
			}
			x %= MOD;
			w[i][j] = x;
		}
		v.swap(w);
		return *this;
	}
	Matrix& operator+=(const Matrix& B) {
		int n = height(), m = width();
		assert(n == B.height() && m == B.width());
		rep(i, n) rep(j, m) {
			at(i, j) += B.at(i, j);
			if(at(i, j) >= MOD) at(i, j) -= MOD;
		}
		return *this;
	}
	void undomult() { v.swap(w); }
};
ostream& operator<<(ostream& o, const Matrix& A) {
	int n = A.height(), m = A.width();
	rep(i, n) {
		o << "["; rep(j, m) o << A.at(i, j) << (j+1 == m ? "]\n" : ",");
	}
	return o;
}

struct GetRangeSegmentTree {
	typedef Matrix Val;
	static Val combineVal(const Val &x, const Val &y) { return y * x; }
	static void combinesVal(Val &x, const Val &y) { x = y * x; }
	static Val identityVal() { return Val::identity(4); } 

	vector<Val> nodes;
	int n;
	void init(int n_, const Val &v = Val()) { init(vector<Val>(n_, v)); }
	void init(const vector<Val> &u) {
		n = 1; while(n < (int)u.size()) n *= 2;
		nodes.resize(n);
		nodes.insert(nodes.end(), u.begin(), u.end());
		nodes.resize(n * 2, Val());
		for(int i = n-1; i > 0; -- i)
			nodes[i] = combineVal(nodes[i*2], nodes[i*2+1]);
	}
	Val get(int i) {
		return nodes[i + n];
	}
	Val getRange(int l, int r) const {
		Val m = identityVal();
		static ll indices[100]; int k = 0;
		for(; l && l + (l&-l) <= r; l += l&-l)
			combinesVal(m, nodes[(n+l) / (l&-l)]);
		for(; l < r; r -= r&-r)
			indices[k ++] = (n+r) / (r&-r) - 1;
		while(-- k >= 0) combinesVal(m, nodes[indices[k]]);
		return m;
	}
	void set(int i, const Val &x) {
		i += n; nodes[i] = x;
		for(i >>= 1; i > 0; i >>= 1)
			nodes[i] = combineVal(nodes[i*2], nodes[i*2+1]);
	}
};


int main(void)
{
    Matrix base(4,4);
    int abase[][4]={{1,0,0,0},{0,0,0,1},{0,0,0,1},{0,0,0,1}};
    rep(i,4)rep(j,4)base.at(i,j)=abase[i][j];
    int n,q;
    read(n,q);
    GetRangeSegmentTree st;
    st.init(n+3,base);
    rep(i,q){
        char c;
        read(c);
        Matrix m(4,4);
        if(c=='a'){
            int j;
            read(j);
            if(j==0){
                write(1);
                continue;
            }
            m=st.getRange(0,j);
            if(i==4&&false){
                rep(tt,3)write(st.get(tt));
                Matrix pp=Matrix::identity(4);
                rep(tt,2)pp*=st.get(tt);
                write(pp);
            }
            ll res=0;
            rep(k,4)
                res=(res+m.at(0,k))%MOD;
            write(res);
            continue;
        }
        ll j,v;
        read(j,v);
        m=st.get(j);
        if(c=='x'){
            m.at(0,2)=v;
        }
        else{
            m.at(1,1)=v;
            m.at(2,1)=2*v;
            m.at(2,2)=(v*v)%MOD;
        }
        st.set(j,m);
    }
    return 0;
}