#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(ll i=0;i<n;i++) #define repl(i,l,r) for(ll i=(l);i<(r);i++) #define per(i,n) for(ll i=(n)-1;i>=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue<x,vector<x>,greater<x>> #define all(x) (x).begin(),(x).end() #define CST(x) cout<<fixed<<setprecision(x) #define vtpl(x,y,z) vector<tuple<x,y,z>> #define rev(x) reverse(x); using ll=long long; using vl=vector<ll>; using vvl=vector<vector<ll>>; using pl=pair<ll,ll>; using vpl=vector<pl>; using vvpl=vector<vpl>; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,-1,0,1,1,1,-1,-1,0}; const ll dx[9]={-1,0,1,0,1,-1,1,-1,0}; template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } //0-indexed,2冪のセグメントツリー template <class T> struct SegTree { private: int n;// 葉の数 vector<T> data;// データを格納するvector T def; // 初期値かつ単位元 function<T(T, T)> operation; // 区間クエリで使う処理 function<T(T, T)> change;// 点更新で使う処理 T find(int a, int b) { T val_left = def, val_right = def; for (a += (n - 1), b += (n - 1); a < b; a >>= 1, b >>= 1) { if ((a & 1) == 0){ val_left = operation(val_left, data[a]); } if ((b & 1) == 0){ val_right = operation(data[--b],val_right); } } return operation(val_left, val_right); } public: // _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数, // _change:更新関数 SegTree(size_t _n, T _def, function<T(T, T)> _operation, function<T(T, T)> _change=[](T a,T b){return b;}) : def(_def), operation(_operation), change(_change) { n = 1; while (n < _n) { n *= 2; } data = vector<T>(2 * n - 1, def); } void set(int i, T x) { data[i + n - 1] = x; } void build() { for (int k=n-2;k>=0;k--) data[k] = operation(data[2*k+1],data[2*k+2]); } // 場所i(0-indexed)の値をxで更新 void update(int i, T x) { i += n - 1; data[i] = change(data[i], x); while (i > 0) { i = (i - 1) / 2; data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]); } } T all_prod(){ return data[0]; } // [a, b)の区間クエリを実行 T query(int a, int b) { //return _query(a, b, 0, 0, n); return find(a,b); } // 添字でアクセス T operator[](int i) { return data[i + n - 1]; } }; const int mod = MOD; const int max_n = 200005; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } bool operator==(const mint &p) const { return x == p.x; } bool operator!=(const mint &p) const { return x != p.x; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} using vm=vector<mint>; using vvm=vector<vm>; struct node{ mint mat[4][4]; node(ll x,ll y){ mat[0][0]=1; mat[1][3]=1; mat[2][3]=1; mat[3][3]=1; mat[0][2]=x; mat[1][1]=y; mat[2][1]=y*2; mat[2][2]=y*y; } }; auto fx=[](node a,node b){ node c(0,0); c.mat[0][0]=0; c.mat[1][3]=0; c.mat[2][3]=0; c.mat[3][3]=0; rep(i,4){ rep(j,4){ rep(k,4){ c.mat[i][j]+=b.mat[i][k]*a.mat[k][j]; } } } return c; }; int main(){ ll n,q;cin >> n >> q; SegTree<node> st(n,node(0,0),fx); vl x(n),y(n); while(q--){ char c;cin >> c; if(c=='x'){ ll i,v;cin >> i >> v; x[i]=v; st.update(i,node(x[i],y[i])); } else if(c=='y'){ ll i,v;cin >> i >> v; y[i]=v; st.update(i,node(x[i],y[i])); } else{ ll i;cin >> i; auto p=st.query(0,i); mint ans=0; rep(j,4)ans+=p.mat[0][j]; cout << ans << endl; } } }