#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int n, m, a[N], tree[N << 2], tag[N << 2], op, l, r, d;
int ls (int x){return x << 1;}
int rs (int x){return x << 1 | 1;}
void add_tag (int x, int l, int r, int d)
{
	tag[x] += d;
	tree[x] += (r - l + 1) * d;
}
void push_up (int x){tree[x] = tree[ls (x)] + tree[rs (x)];}
void push_down (int x, int l, int r)
{
	if (tag[x])
	{
		int mid = (l + r) >> 1;
		add_tag (ls (x), l, mid, tag[x]);
		add_tag (rs (x), mid + 1, r, tag[x]);
		tag[x] = 0;
	}
}
void build (int x, int l, int r)
{
	if (l == r){tree[x] = a[l];return;}
	int mid = (l + r) >> 1;
	build (ls (x), l, mid);
	build (rs (x), mid + 1, r);
	push_up (x);
}
void update (int x, int l, int r, int d, int L, int R)
{
	if (L <= l && r <= R)
	{
		add_tag (x, l, r, d);
		return;
	}
	push_down (x, l, r);
	int mid = (l + r) >> 1;
	if (L <= mid)update (ls (x), l, mid, d, L, R);
	if (mid < R)update (rs (x), mid + 1, r, d, L, R);
	push_up (x);
}
int query (int x, int l, int r, int L, int R)
{
	if (L <= l && r <= R)return tree[x];
	push_down (x, l, r);
	int mid = (l + r) >> 1, s = 0;
	if (L <= mid)s += query (ls (x), l, mid, L, R);
	if (mid < R)s += query (rs (x), mid + 1, r, L, R);
	return s;
}
signed main ()
{
	ios::sync_with_stdio (0), cin.tie (0), cout.tie (0);
//	 freopen ("structure.in", "r", stdin);
//	 freopen ("structure.out", "w", stdout);
	cin >> n >> m;
	for (int i = 1; i <= n; ++ i)cin >> a[i];
	build (1, 1, n);
	while (m --)
	{
		int k;
		cin >> op;
		if (op == 1)
		{
			cin >> k >> l >> r >> d;
			update (1, 1, n, d, l, r);
		}
		else 
		{
			cin >> l >> r;
			cout << query (1, 1, n, l, r) << '\n';
		}
	}
	return 0;
}