#include <iostream>
#include <cstdio>

using namespace std;

typedef long long LL;

const int N = 200005, P = 1e9 + 7;

int n, m, Div2, s[N], A[N], B[N];

int v[N << 2], sum[N << 2], sa[N << 2], sb[N << 2], sc[N << 2];

int inline power(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = (LL)res * a % P;
		a = (LL)a * a % P;
		b >>= 1;
	}
	return res;
}

int inline calc(int l, int r, int a, int b, int c) {
	int x2 = ((LL)A[r] - A[l - 1] + P) % P, x1 = ((LL)B[r] - B[l - 1] + P) % P, x0 = r - l + 1;
	return ((LL)x2 * a + (LL)x1 * b + (LL)x0 * c) % P;
}

void inline pushup(int p) {
	sum[p] = ((LL)v[p] + sum[p << 1] + sum[p << 1 | 1]) % P;
}

void inline change(int p, int l, int r, int x, int y, int a, int b, int c) {
 	if (l > r) return;
	if (x <= l && r <= y) {
		(sa[p] += a) %= P, (sb[p] += b) %= P, (sc[p] += c) %= P;
		(v[p] += calc(l, r, a, b, c)) %= P;
		(sum[p] += calc(l, r, a, b, c)) %= P;
		return;
	}
	int mid = (l + r) >> 1;
	if (x <= mid) change(p << 1, l, mid, x, y, a, b, c);
	if (mid < y) change(p << 1 | 1, mid + 1, r, x, y, a, b, c);
	pushup(p);
}


int inline query(int p, int l, int r, int x, int y) {
	if (x <= l && r <= y) return sum[p];
	int mid = (l + r) >> 1, res = calc(max(x, l), min(y, r), sa[p], sb[p], sc[p]);
	if (x <= mid) (res += query(p << 1, l, mid, x, y)) %= P;
	if (mid < y) (res += query(p << 1 | 1, mid + 1, r, x, y)) %= P;
	return res;
}

int inline ask(int l, int r) {
	if (l == 0 && r == 0) return 0;
	if (l == 0) l++;
	return ((LL)s[r] - s[l - 1] + P + query(1, 1, n, l, r)) % P;
}

int main() {
	Div2 = power(2, P - 2);
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%d", s + i);
		s[i] = (s[i - 1] + s[i]) % P;
		A[i] = (A[i - 1] + (LL)i * i) % P;
		B[i] = (B[i - 1] + i) % P;
	}
	for (int i = 1; i <= n; i++)
		(s[i] += s[i - 1]) %= P;
	for (int i = 1; i <= n; i++)
		(s[i] += s[i - 1]) %= P;
	while (m--) {
		int opt, l, r; scanf("%d%d%d", &opt, &l, &r);
		if (l > r) swap(l, r);
		if (opt == 1) {
			int d; scanf("%d", &d);
			change(1, 1, n, l, r, (LL)d * Div2 % P, (LL)d * (3 - 2ll * l + P) % P * Div2 % P, (LL)d * ((2 + (LL)l * (l - 3 + P)) % P) % P * Div2 % P);
			int k = (LL)d * (r - l + 1) % P, u = (LL)d * (r - l + 2) % P * (r - l + 1) % P * Div2 % P;
			change(1, 1, n, r + 1, n, 0, k, (P - (LL)r * k % P + u) % P);
		} else {
			printf("%lld\n", ((LL)ask(n, n) * (r - l + 1) - ask(l - 1, r - 1) - ask(n - r, n - l) + 2 * P) % P);
		}
	}
	return 0;
}