#include <bits/stdc++.h>
#define _for(i, a, b)  for (int i = (a); i <= (b); i ++ )
#define ll long long
using namespace std;
const int N = 1e5 + 5, P = 1e9 + 7; const ll inf = (ll)1e18 + 5;
int n, q, a[N];
struct Node { ll s[11]; } t;
inline Node operator + (Node u, Node v) {
	Node res;
	_for (i, 0, 10)  res.s[i] = u.s[i] + v.s[i];
	return res;
}
inline void Add(ll & x, ll y) { (x += y) %= P; }
inline void Mul(ll & x, ll y) { (x *= y) %= P; }
inline ll pw(ll a, int b) {
	ll res = 1;
	while (b) {
		if (b & 1)  Mul(res, a);
		Mul(a, a), b >>= 1;
	}
	return res;
}
struct Seg_Tree {
	#define lc (p << 1)
	#define rc (p << 1 | 1)
	#define val(p)  tr[p].val
	#define tag_add(p)  tr[p].tag_add
	#define tag_cov(p)  tr[p].tag_cov
	#define mid ((tr[p].l + tr[p].r) >> 1)
	struct Tree { int l, r; ll tag_add, tag_cov; Node val; } tr[N << 2];
	inline int len(int p) { return tr[p].r - tr[p].l + 1; }
	inline bool In(int p, int l, int r) { return l <= tr[p].l && tr[p].r <= r; }
	inline void push_tag_add(int p, ll k) {
		t = val(p), Add(tag_add(p), k);
		val(p).s[0] = len(p);
		val(p).s[1] = (t.s[1] + k * len(p) % P) % P;
		val(p).s[2] = (t.s[2] + 2ll * k % P * t.s[1] % P + pw(k, 2) * len(p) % P) % P;
		val(p).s[3] = (t.s[3] + 3ll * k % P * t.s[2] % P + 3ll * pw(k, 2) % P * t.s[1] % P + pw(k, 3) * len(p) % P) % P;
		val(p).s[4] = (t.s[4] + 4ll * k % P * t.s[3] % P + 6ll * pw(k, 2) % P * t.s[2] % P + 4ll * pw(k, 3) % P * t.s[1] % P + pw(k, 4) * len(p) % P) % +p;
		val(p).s[5] = (t.s[5] + 5ll * k % P * t.s[4] % P + 10ll * pw(k, 2) % P * t.s[3] % P + 10ll * pw(k, 3) % P * t.s[2] % P + 5ll * pw(k, 4) % P * t.s[1] % P + pw(k, 5) * len(p) % P) % P;
		val(p).s[6] = (t.s[6] + 6ll * k % P * t.s[5] % P + 15ll * pw(k, 2) % P * t.s[4] % P + 20ll * pw(k, 3) % P * t.s[3] % P + 15ll * pw(k, 4) % P * t.s[2] % P + 6ll * pw(k, 5) % P * t.s[1] % P + pw(k, 6) * len(p) % P) % P;
		val(p).s[7] = (t.s[7] + 7ll * k % P * t.s[6] % P + 21ll * pw(k, 2) % P * t.s[5] % P + 35ll * pw(k, 3) % P * t.s[4] % P + 35ll * pw(k, 4) % P * t.s[3] % P + 21ll * pw(k, 5) % P * t.s[2] % P + 7ll * pw(k, 6) % P * t.s[1] % P + pw(k, 7) * len(p)) % P;
		val(p).s[8] = (t.s[8] + 8ll * k % P * t.s[7] % P + 28ll * pw(k, 2) % P * t.s[6] % P + 56ll * pw(k, 3) % P * t.s[5] % P + 70ll * pw(k, 4) % P * t.s[4] % P + 56ll * pw(k, 5) % P * t.s[3] % P + 28ll * pw(k, 6) % P * t.s[2] % P + 8ll * pw(k, 7) % P * t.s[1] % P + pw(k, 8) * len(p)) % P;
		val(p).s[9] = (t.s[9] + 9ll * k % P * t.s[8] % P + 36ll * pw(k, 2) % P * t.s[7] % P + 84ll * pw(k, 3) % P * t.s[6] % P + 126ll * pw(k, 4) % P * t.s[5] % P + 126ll * pw(k, 5) % P * t.s[4] % P + 84ll * pw(k, 6) % P * t.s[3] % P + 36ll * pw(k, 7) % P * t.s[2] % P + 9ll * pw(k, 8) % P * t.s[1] % P + pw(k, 9) * len(p)) % P;
		val(p).s[10] = (t.s[10] + 10ll * k % P * t.s[9] % P + 45ll * pw(k, 2) % P * t.s[8] % P + 120ll * pw(k, 3) % P * t.s[7] % P + 210ll * pw(k, 4) % P * t.s[6] % P + 252ll * pw(k, 5) % P * t.s[5] % P + 210ll * pw(k, 6) % P * t.s[4] % P + 120ll * pw(k, 7) % P * t.s[3] % P + 45ll * pw(k, 8) % P * t.s[2] % P + 10ll * pw(k, 9) % P * t.s[1] % P + pw(k, 10) * len(p)) % P;
	}
	inline void push_tag_cov(int p, ll k) {
		tag_cov(p) = k;
		_for (i, 0, 10)  val(p).s[i] = pw(k, i) * len(p);
	}
	inline void push_up(int p) { val(p) = val(lc) + val(rc); }
	inline void push_down(int p) {
		if (tag_add(p))  push_tag_add(lc, tag_add(p)), push_tag_add(rc, tag_add(p)), tag_add(p) = 0;
		if (tag_cov(p) ^ inf)  push_tag_cov(lc, tag_cov(p)), push_tag_cov(rc, tag_cov(p)), tag_cov(p) = inf;
	}
	void build(int p, int l, int r) {
		tr[p].l = l, tr[p].r = r, tag_add(p) = 0, tag_cov(p) = inf;
		if (l == r) {
			_for (i, 0, 10)  val(p).s[i] = pw(a[l], i);
			return ;
		}
		build(lc, l, mid), build(rc, mid + 1, r), push_up(p);
	}
	void update_add(int p, int l, int r, ll k) {
		if (In(p, l, r))  return push_tag_add(p, k), void();
		push_down(p);
		if (l <= mid)  update_add(lc, l, r, k);
		if (r > mid)  update_add(rc, l, r, k);
		push_up(p);
	}
	void update_cov(int p, int l, int r, ll k) {
		if (In(p, l, r))  return push_tag_cov(p, k), void();
		push_down(p);
		if (l <= mid)  update_cov(lc, l, r, k);
		if (r > mid)  update_cov(rc, l, r, k);
		push_up(p);
	}
	Node query(int p, int l, int r) {
		if (In(p, l, r))  return val(p);
		push_down(p);
		if (r <= mid)  return query(lc, l, r);
		if (l > mid)  return query(rc, l, r);
		return query(lc, l, r) + query(rc, l, r);
	}
	#undef lc
	#undef rc
	#undef mid
} T;
int main() {
	ios :: sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n >> q; int op, l, r; ll k;
	_for (i, 1, n)  cin >> a[i];
	T.build(1, 1, n);
	while (q -- ) {
		cin >> op >> l >> r >> k;
		if (op == 1)  T.update_add(1, l, r, k);
		else if (op == 2)  T.update_cov(1, l, r, k);
		else  cout << T.query(1, l, r).s[k] << "\n";
	}
	return 0;
}