#include<bits/stdc++.h>
#define mod 1000000007LL;
using namespace std;

int N, M;
long long a[100005];
int op, l, r;
long long x;

long long qpow(long long a, long long b){
	long long res = 1;
	while (b){
		if (b & 1) res = (res * a) % mod;
		a = (a * a) % mod;
		b >>= 1;
	}
	return res;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d %d", &N, &M);
	for (int i = 1; i <= N; i ++){
		scanf("%lld", &a[i]);
	}
	while (M --){
		scanf("%d %d %d %lld", &op, &l, &r, &x);
		if (op == 1){
			for (int i = l; i <= r; i ++){
				a[i] += x;
			}
		}else if (op == 2){
			for (int i = l; i <= r; i ++){
				a[i] = x;
			}
		}else{
			long long ans = 0;
			for (int i = l; i <= r; i ++){
				ans += qpow(a[i], x);
				ans %= mod;
			}
			printf("%lld\n", ans);
		}
	}
}