#include<bits/stdc++.h>
#define int long long
#define lc (p<<1)
#define rc (p<<1|1)
#define mid ((s+t)>>1)
using namespace std;
const int mn=1e6+5,mod=1e9+7;
int a[mn];
int n,m;
int b[mn<<2][13];
int lz[mn<<2],lt[mn<<2];
// int tmp[13];
// int dxsqh
void ptg(int p,int c,int type)
{
    if(type==1)
    {
        b[p][10]-=c*((10*b[p][9]+c*((45*b[p][8]+c*((120*b[p][7]+c*((210*b[p][6]+c*((252*b[p][5]+c*((210*b[p][4]+c*((120*b[p][3]+c*((45*b[p][2]+c*((10*b[p][1]+c*b[p][0])%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod;
        b[p][9]-=c*((9*b[p][8]+c*((36*b[p][7]+c*((84*b[p][6]+c*((126*b[p][5]+c*((126*b[p][4]+c*((84*b[p][3]+c*((36*b[p][2]+c*((9*b[p][1]+c*b[p][0]%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod;
        b[p][8]-=c*((8*b[p][7]+c*((28*b[p][6]+c*((56*b[p][5]+c*((70*b[p][4]+c*((56*b[p][3]+c*((28*b[p][2]+c*((8*b[p][1]+c*b[p][0]%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod;
        b[p][7]-=c*((7*b[p][6]+c*((21*b[p][5]+c*((35*b[p][4]+c*((35*b[p][3]+c*((21*b[p][2]+c*((7*b[p][1]+c*b[p][0]%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod;
        b[p][6]-=c*((6*b[p][5]+c*((15*b[p][4]+c*((20*b[p][3]+c*((15*b[p][2]+c*((6*b[p][1]+c*b[p][0]%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod;
        b[p][5]-=c*((5*b[p][4]+c*((10*b[p][3]+c*((10*b[p][2]+c*((5*b[p][1]+c*b[p][0]%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod)%mod;
        b[p][4]-=c*((4*b[p][3]+c*((6*b[p][2]+c*((4*b[p][1]+c*b[p][0]%mod)%mod)%mod)%mod)%mod)%mod)%mod;
        b[p][3]-=c*((3*b[p][2]+c*((3*b[p][1]+c*b[p][0]%mod)%mod)%mod)%mod)%mod;
        b[p][2]-=c*((2*b[p][1]+c*b[p][0]%mod)%mod)%mod;
        b[p][1]-=c*b[p][0];
        // b[p][0];
        b[p][10]=(b[p][10]+mod)%mod;
        b[p][9]=(b[p][9]+mod)%mod;
        b[p][8]=(b[p][8]+mod)%mod;
        b[p][7]=(b[p][7]+mod)%mod;
        b[p][6]=(b[p][6]+mod)%mod;
        b[p][5]=(b[p][5]+mod)%mod;
        b[p][4]=(b[p][4]+mod)%mod;
        b[p][3]=(b[p][3]+mod)%mod;
        b[p][2]=(b[p][2]+mod)%mod;
        b[p][1]=(b[p][1]+mod)%mod;
    }
    else if(type==2)
    {
        for(int i=1;i<=10;i++)
        {
            b[p][i]=(b[p][i-1]*c)%mod;
        }
    }
    if(type==1)
    {
        lt[p]=max(type,lt[p]);
        lz[p]+=c;
    }
    else if(type==2)
    {
        lt[p]=2;
        lz[p]=c;
    }
}
void pup(int p)
{
    for(int i=0;i<=10;i++)
    {
        b[p][i]=(b[lc][i]+b[rc][i])%mod;
    }
}
void psd(int p)
{
    ptg(lc,lz[p],lt[p]);
    ptg(rc,lz[p],lt[p]);
    lz[p]=lt[p]=0;
}
void build(int s,int t,int p)
{
    if(s==t)
    {
        b[p][0]=1;
        for(int i=1;i<=10;i++)
        {
            b[p][i]=(b[p][i-1]*a[s])%mod;
        }
        return;
    }
    build(s,mid,lc);
    build(mid+1,t,rc);
    pup(p);
}
void upd(int l,int r,int c,int ct,int s,int t,int p)
{
    if(l<=s && t<=r)return ptg(p,c,ct);
    psd(p);
    if(l<=mid)upd(l,r,c,ct,s,mid,lc);
    if(r>mid)upd(l,r,c,ct,mid+1,t,rc);
    pup(p);
}
int qry(int l,int r,int x,int s,int t,int p)
{
    if(l<=s && t<=r)return b[p][x];
    int res=0;
    if(l<=mid)res+=qry(l,r,x,s,mid,lc);
    if(r>mid)res+=qry(l,r,x,mid+1,t,rc);
    res%=mod;
    return res;
}
signed main()
{
    int op,l,r,x;
    scanf("%lld%lld",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    build(1,n,1);
    for(int i=1;i<=m;i++)
    {
        scanf("%lld%lld%lld%lld",&op,&l,&r,&x);
        if(op==1)upd(l,r,x,op,1,n,1);
        if(op==2)upd(l,r,x,op,1,n,1);
        if(op==3)printf("%lld\n",qry(l,r,x,1,n,1));
    }
    return 0;
}