#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int a[N];
struct Tree{
	#define ls (k << 1)
	#define rs (k << 1 | 1)
	int t[N << 2], tag[N << 2];
	void f(int k, int l, int r, int v) {
		t[k] += (l - r + 1) * v;
		tag[k] += v;
	}
	void up(int k) {
		t[k] = t[ls] + t[rs];
	}
	void down(int k, int l, int r) {
		if(!tag[k]) return ;
		int m = l + r >> 1;
		f(ls, l, m, tag[k]);
		f(rs, m + 1, r, tag[k]);
		tag[k] = 0; 
	}
	void built(int k, int l, int r) {
		tag[k] = 0;
		if(l == r) {
			t[k] = a[l];
			return ;
		}
		int m = l + r >> 1;
		built(ls, l, m);
		built(rs, m + 1, r);
		up(k);
	}
	int sum(int k, int l, int r, int x, int y) {
		if(x <= l && y >= r) return t[k];
		int m = l + r >> 1, res = 0;
		if(x <= m) res += sum(ls, l, m, x, y);
		if(y >= m + 1) res += sum(rs, m + 1, r, x, y);
		return res;
	}
	void mdf(int k, int l, int r, int x, int y, int v) {
		if(x <= l && y >= r) return f(k, l, r, v);
		int m = l + r >> 1;
		down(k, l, r);
		if(x <= m) mdf(ls, l, m, x, y, v);
		if(y >= m + 1) mdf(rs, m + 1, r, x, y, v);
		up(k);
	}
} T; 
signed main() {
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	} 
	T.built(1, 1, n); 
	while(m--) {
		int op, l, r, y;
		cin >> op >> l >> r;
		if(op == 1) {
			cin >> y;
			T.mdf(1, 1, n, l, r, y);
		}
		if(op == 2) {
			cout << T.sum(1, 1, n, l, r) << endl;
		} 
		 
	}
	return 0;
}

感觉没什么问题，但就是不对