#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[200005];
struct node{
	int l,r;
	mutable long long v;
	node(int L,int R = -1, long long V = 0):l(L),r(R),v(V){}
	bool operator<(const node &o) const {
		return l<o.l;
	}
};set<node>s;
set<node>::iterator split(int pos){
	auto it= s.lower_bound(node(pos));
	if(it!=s.end() and it->l == pos)return it;
	it--;
	int L = it->l,R = it->r;
	long long V = it->v;
	s.erase(it);
	s.insert(node(L,pos-1,V));
	return s.insert(node(pos,R,V)).first;
}void assign(int l,int r,long long val){
	auto itr = split(r+1),itl = split(l);
	s.erase(itl,itr);
	s.insert(node(l,r,val));return;
}void add(int l,int r,long long val){
	auto itr = split(r+1),itl = split(l);
	for(;itl!=itr;++itl){
		itl->v+=val;
	}return;
}long long rk(int l,int r,int k){
	vector<pair<long long,int> >p;
	auto itr = split(r+1),itl = split(l);
	for(;itl!=itr;++itl){
		p.push_back({itl->v,itl->r-itl->l+1});
	}sort(p.begin(),p.end());
	for(int i =0;i<p.size();i++){
		k-=p[i].second;
		if(k<=0)return p[i].first;
	}
}
const int mod = 1000000007;
int qp(int p,int q,int mod){
	int ans =1,pro = p%mod;
	while(q){
		if(q&1)ans = ans*pro%mod;
		q>>=1,pro = pro*pro%mod;
	}return ans;
}int sum(int l,int r,int q,int mod){
	auto itr=split(r+1),itl = split(l);
	int ans =0 ;
	for(;itl!=itr;itl++){
		ans+=(itl->r-itl->l+1)*qp(itl->v,q,mod)%mod,ans%=mod;
	}return ans;
}int n,m;
signed main(){
	cin >> n >> m;
	for(int i = 1;i<=n;i++){
		cin >> a[i];
		s.insert(node(i,i,a[i]));
	}for(int i = 1;i<=m;i++){
		int op,l,r,x;cin >> op >> l >> r >> x;
		if(op == 1){
			add(l,r,x);
		}else if(op == 2){
			assign(l,r,x);
		}else{
			cout << sum(l,r,x,mod) << endl;
		}
	}
	return 0;
}