#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;

int n, m;
ll a[100005];

int main() {
    // freopen("filename.in", "r", stdin);
    // freopen("filename.out", "w", stdout);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
    	cin >> a[i];
    }
    
    while (m--) {
    	int op, l, r, x;
    	cin >> op >> l >> r >> x;
    	if (op == 1) {
    		for (int i = l ; i <= r; i++) {
    			a[i] += (ll)x;
    		}
    	}else if (op == 2) {
    		for (int i = l ; i <= r; i++) {
    			a[i] = (ll)x;
    		}
    	} else {
    		ll tot = 0;
    		for (int i = l ; i <= r; i++) {
    			tot = (ll)(tot + pow(a[i], x)) % mod;
    		}
    		cout << tot << endl;
    	}
    }
    
    return 0;
}