#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define fir first
#define sec second
#define MAXN 100010
const int mod=1e9+7;
int n,m;
ll a[MAXN],C[11][11];
struct nod{
	int l,r;ll val[11],lazy=0;set<pll>lazy1;pll lazy2={0,0};
}tree[MAXN<<2];
inline ll power(ll a,ll b){
	if(!b||a==1) return 1;
	if(b&1) return power(a,b-1)*a%mod;
	ll x=power(a,b>>1);return x*x%mod;
}inline void change(int id,ll delta){
	ll val[11];memset(val,0,sizeof(val));
	for(int i=0;i<=10;++i)for(int j=0;j<=i;++j)
		(val[i]+=C[i][j]*power(delta,i-j)%mod*tree[id].val[j])%=mod;
	for(int i=0;i<=10;++i) tree[id].val[i]=val[i];
}inline void pushdown(int id){
	if(tree[id].l==tree[id].r){tree[id].lazy2={0,0};return;}
	int v=id<<1;
	if(tree[id].lazy2>tree[v].lazy2){
		tree[v].lazy2=tree[id].lazy2;
		while(!tree[v].lazy1.empty()&&(*tree[v].lazy1.begin()).fir<tree[v].lazy2.fir)
			(tree[v].lazy+=mod-(*tree[v].lazy1.begin()).sec)%=mod,
			tree[v].lazy1.erase(tree[v].lazy1.begin());
		tree[v].val[0]=tree[v].r-tree[v].l+1;
		for(int i=1;i<=10;++i)
			tree[v].val[i]=(tree[v].val[i-1]*tree[v].lazy2.sec)%mod;
		change(v,tree[v].lazy);
	}for(auto it=tree[id].lazy1.begin();it!=tree[id].lazy1.end();++it)
		if(!tree[v].lazy1.count(*it)&&(*it).fir>tree[v].lazy2.fir)
			tree[v].lazy1.insert(*it),change(v,(*it).sec),
			(tree[v].lazy+=(*it).sec)%=mod;
	++v;
	if(tree[id].lazy2>tree[v].lazy2){
		tree[v].lazy2=tree[id].lazy2;
		while(!tree[v].lazy1.empty()&&(*tree[v].lazy1.begin()).fir<tree[v].lazy2.fir)
			(tree[v].lazy+=mod-(*tree[v].lazy1.begin()).sec)%=mod,
			tree[v].lazy1.erase(tree[v].lazy1.begin());
		tree[v].val[0]=tree[v].r-tree[v].l+1;
		for(int i=1;i<=10;++i)
			tree[v].val[i]=(tree[v].val[i-1]*tree[v].lazy2.sec)%mod;
		change(v,tree[v].lazy);
	}for(auto it=tree[id].lazy1.begin();it!=tree[id].lazy1.end();++it)
		if(!tree[v].lazy1.count(*it)&&(*it).fir>tree[v].lazy2.fir)
			tree[v].lazy1.insert(*it),change(v,(*it).sec),
			(tree[v].lazy+=(*it).sec)%=mod;
}inline void pushup(int id){
	if(tree[id].l==tree[id].r) return;
	pushdown(id),pushdown(id<<1),pushdown(id<<1|1);
	for(int i=0;i<=10;++i)
		tree[id].val[i]=(tree[id<<1].val[i]+tree[id<<1|1].val[i])%mod;
}inline void st_build(int id,int l,int r){
	tree[id].l=l,tree[id].r=r;
	if(l==r){
		tree[id].val[0]=1;
		for(int i=1;i<=10;++i) tree[id].val[i]=tree[id].val[i-1]*a[l]%mod;
		return;
	}int mid=(l+r)>>1;
	st_build(id<<1,l,mid),st_build(id<<1|1,mid+1,r),pushup(id);
}inline void st_modify1(int id,int l,int r,int s,ll delta){
	pushdown(id);
	if(l<=tree[id].l&&tree[id].r<=r){
		tree[id].lazy1.insert({s,delta}),
		change(id,delta),
		(tree[id].lazy+=delta)%=mod;
		return;
	}int mid=(tree[id].l+tree[id].r)>>1;
	if(l<=mid) st_modify1(id<<1,l,r,s,delta);
	if(mid<r) st_modify1(id<<1|1,l,r,s,delta);
	pushup(id);
}inline void st_modify2(int id,int l,int r,int s,ll num){
	pushdown(id);
	if(l<=tree[id].l&&tree[id].r<=r){
		tree[id].lazy2={s,num};
		tree[id].val[0]=tree[id].r-tree[id].l+1;
		for(int i=1;i<=10;++i) tree[id].val[i]=(tree[id].val[i-1]*num)%mod;
		tree[id].lazy1.clear(),tree[id].lazy=0;
		return;
	}int mid=(tree[id].l+tree[id].r)>>1;
	if(l<=mid) st_modify2(id<<1,l,r,s,num);
	if(mid<r) st_modify2(id<<1|1,l,r,s,num);
	pushup(id);
}inline ll st_query(int id,int l,int r,int p){
	pushdown(id);
	if(l<=tree[id].l&&tree[id].r<=r) return tree[id].val[p];
	int mid=(tree[id].l+tree[id].r)>>1;
	ll sum=0;
	if(l<=mid) sum+=st_query(id<<1,l,r,p);
	if(mid<r) sum+=st_query(id<<1|1,l,r,p);
	return sum%mod;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;++i) cin>>a[i];
	for(int i=0;i<=10;++i) C[i][0]=1;
	for(int i=1;i<=10;++i)for(int j=1;j<=i;++j)
		C[i][j]=C[i-1][j]+C[i-1][j-1];
	st_build(1,1,n);
	short type;int l,r,x;
	for(int s=1;s<=m;++s){
		cin>>type>>l>>r>>x;
		if(n<=1000){
			if(type==1) for(int i=l;i<=r;++i) (a[i]+=x)%=mod;
			if(type==2) for(int i=l;i<=r;++i) a[i]=x;
			if(type==3){
				ll ans=0;
				for(int i=l;i<=r;++i) (ans+=power(a[i],x))%=mod;
				cout<<ans<<endl;
			}continue;
		}if(type==1) st_modify1(1,l,r,s,x);
		if(type==2) st_modify2(1,l,r,s,x);
		if(type==3) cout<<st_query(1,l,r,x)<<endl;
	}
	return 0;
}/*
5 6
1 2 3 4 5
3 1 5 2
3 2 4 3
1 1 1 2
3 1 3 3
2 3 5 4
3 1 4 2
*/