#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define pi pair<ll, ll>
#define se second
#define mod 1000000007ll
#define N 111111
/*
struct h{
    ll t, x, y, bh;
    void read(int k, int i){
        t = k;
        bh = i;
        scanf("%lld%lld", &x, &y);
    }
    bool operator<(const h &r)const{
        return x != r.x ? x < r.x : y > r.y;
    }
}q[4][N];
//*/
struct frac
{
    ll a, b, c;
    void init()
    {
        ll g = __gcd(b, c);
        b /= g, c /= g;
    }
} res[N];
ll y[N];
ll n, k, m, tot[4], op[N], x[N], a[N], b[N], qu[N], nxt[N], cnt;
ll ans[N] = {1};
// priority_queue<ld> q;
ll bigmul(ll a, ll b, ll m)
{
    unsigned long long c =
        (unsigned long long)a * b -
        (unsigned long long)((long double)a / m * b + 0.5L) * m;
    return (c + m) % m;
}
ll qpow(ll x, ll y)
{
    ll ans = 1, res = x % mod;
    while (y)
    {
        if (y & 1)
            ans = bigmul(ans, res, mod);
        res = bigmul(res, res, mod);
        y >>= 1;
    }
    return ans;
}
ll inv(ll x)
{
    return qpow(x, mod - 2);
}
priority_queue<pair<ld, ll>> q;
void print(ll *a, ll cnt)
{
    if (!cnt)
        return;
    printf("%lld%c", *a, " \n"[!cnt]);
    print(a + 1, cnt - 1);
}
signed main()
{
    scanf("%lld%lld", &n, &m);
    op[0] = 3;
    y[0] = 1;
    for (int i = 1; i <= n; i++)
    {
        scanf("%lld", &a[i]);
        b[i] = a[i];
        ans[0] *= a[i];
        ans[0] %= mod;
        q.push({1.0, 0});
    }
    for (int i = 1; i <= m; i++)
    {
        scanf("%lld%lld%lld", &op[i], &x[i], &y[i]);
        // q[op][++tot[op]].read(op, i);
        ++tot[op[i]];
        if (op[i] == 1)
        {
        	if(qu[x[i]] < y[i])
            	qu[x[i]] = y[i], nxt[x[i]] = i;
            // qu[N] = max(qu[N], q[1][tot[op]].y - a[i]);
        }
        else if (op[i] == 2)
        {
            q.push({1.0 * (y[i] + a[x[i]]) / a[x[i]], i});
        }
        else
        {
            q.push({y[i], i});
            cnt++;
        }
    }
    // sort(q[1] + 1, q[1] + 1 + tot[1]);
    for (int i = 1; i <= n; i++)
    {
        if (qu[i] > a[i]){
            q.push({1.0 * (qu[i]) / a[i], nxt[i]});
            //cerr << i << " " << nxt[i] << " moo\n";
		}
    }
    /*
    if(!tot[2]){
    	for(int i = 1 ; i <= m ; i++){
    		
		}
    	return 0;
	}
    if((m - cnt) * m <= 20000000){
    	ll prod = 1, tmp;
    	for(int i = 1 ; i <= m ; i++){
    		tmp = 1;
    		int bh = q.top().se;
    		ans[i] = tmp * prod % mod;
		}
		print(ans, m + 1);
    	return 0;
	}
	//*/
    for (int i = 1; i <= m; i++)
    {
    	int bh = q.top().se;
    	ll res = 0;
    	if(op[bh] == 1){
    		res = (y[bh] - b[x[bh]] + a[x[bh]]) * inv(a[x[bh]]) % mod;
    		a[x[bh]] += y[bh] - b[x[bh]];
		}
		else if(op[bh] == 2){
			res = (y[bh] + a[x[bh]]) * inv(a[x[bh]]) % mod;
			a[x[bh]] += y[bh];
		}
    	else{
    		res = y[bh];
		}
        ans[i] = res * ans[i - 1] % mod;
        //cerr << res << " \n"[i == m];
        q.pop();
    }
    print(ans, m + 1);
    exit(0);
}
/*
2 4
13 20
1 1 14
1 2 30
2 1 6
3 2 2

*/