#include<bits/stdc++.h>
using namespace std;
namespace io{
	char buf[1<<20],*p1=buf,*p2=buf;
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin)),p1==p2?EOF:*p1++)
	int read(){
		int x=0,f=0;char c=gc();
		while(c< '0'||c> '9') f|=c=='-',c=gc();
		while(c>='0'&&c<='9') x=x*10+(c^48),c=gc();
		return f?-x:x;
	}
	char pbuf[1<<20],*pp=pbuf;
#define flush() (fwrite(pbuf,1,pp-pbuf,stdout),pp=pbuf)
#define pc(ch) (pp==pbuf+(1<<20)&&flush(),*pp++=(ch))
	class Flush{public:~Flush(){flush();}}_;
	void write(int x,char ch=0){
		if(x<0) pc('-'),x=-x;
		static int st[35];int top=0;
		do st[top++]=x%10,x/=10;while(x);
		while(top) pc(st[--top]^48);if(ch) pc(ch);
	}
	void putc(char ch){pc(ch);}
}
#define ll long long
#define N 100009
const int mo=1000000007;
const int C[11][11]={
	{1,0,0,0,0,0,0,0,0,0,0,},
	{1,1,0,0,0,0,0,0,0,0,0,},
	{1,2,1,0,0,0,0,0,0,0,0,},
	{1,3,3,1,0,0,0,0,0,0,0,},
	{1,4,6,4,1,0,0,0,0,0,0,},
	{1,5,10,10,5,1,0,0,0,0,0,},
	{1,6,15,20,15,6,1,0,0,0,0,},
	{1,7,21,35,35,21,7,1,0,0,0,},
	{1,8,28,56,70,56,28,8,1,0,0,},
	{1,9,36,84,126,126,84,36,9,1,0,},
	{1,10,45,120,210,252,210,120,45,10,1,},
};
int qp(int a,int b){
	int r=1;
	for(;b;b>>=1,a=(ll)a*a%mo)
		if(b&1) r=(ll)r*a%mo;
	return r;
}
struct node{int l,r,k,x,s[11];};
struct sgt{
#define p1 p<<1
#define p2 p<<1|1
#define mid (t[p].r+t[p].l)>>1
#define len(x) (t[x].r-t[x].l+1)
	node t[N*4];
	void update(int p){
		for(int i=0;i<=10;i++)
			t[p].s[i]=t[p1].s[i]+t[p2].s[i];
	}
	void f(int p,int k,int x){
		if(x!=-1){
			t[p].k=k;t[p].x=x;
			x=(x+k)%mo;
			for(int i=0;i<=10;i++)
				t[p].s[i]=(ll)len(p)*qp(x,i)%mo;
		}else{
			t[p].k=(t[p].k+k)%mo;
			for(int i=10;i>=0;i--)
				for(int j=i-1,ki=1;j>=0;j--)
					ki=(ll)ki*k%mo,t[p].s[i]=(t[p].s[i]+(ll)t[p].s[j]*C[i][j]%mo*ki)%mo;
		}
	}
	void pushdown(int p){
		int k=t[p].k;
		int x=t[p].x;
		f(p1,k,x);
		f(p2,k,x);
		t[p].k=0;
		t[p].x=-1;
	}
	void build(int p,int l,int r,int *a){
		t[p].l=l,t[p].r=r,t[p].k=0,t[p].x=-1;
		if(l==r){
			for(int i=0;i<=10;i++)
				t[p].s[i]=qp(a[l],i);
			return;
		}
		int m=mid;
		build(p1,l,m,a);
		build(p2,m+1,r,a);
		update(p);
	}
	int ask(int p,int l,int r,int i){
		if(l<=t[p].l&&t[p].r<=r)
			return t[p].s[i];
		int m=mid,ret=0;
		pushdown(p);
		if(l<=m) ret=(ret+ask(p1,l,r,i))%mo;
		if(r> m) ret=(ret+ask(p2,l,r,i))%mo;
		return ret;
	}
	void chg(int p,int l,int r,int k,int x){
		if(l<=t[p].l&&t[p].r<=r){
			f(p,k,x);
			return;
		}
		int m=mid;
		pushdown(p);
		if(l<=m) chg(p1,l,r,k,x);
		if(r> m) chg(p2,l,r,k,x);
		update(p); 
	}
}t;
int a[N];
int main(){
//	freopen("in.in","r",stdin);
	int n,m;
	n=io::read();
	m=io::read();
	for(int i=1;i<=n;i++) a[i]=io::read();
	t.build(1,1,n,a);
	while(m--){
		int o,l,r,x;
		x=(x+mo)%mo;
		o=io::read();
		l=io::read();
		r=io::read();
		x=io::read();
		if(o==1) t.chg(1,l,r,x,-1);
		else if(o==2) t.chg(1,l,r,0,x);
		else io::write(t.ask(1,l,r,x),'\n');
	}
	return 0;
}