代码：

#include <bits/stdc++.h>
using namespace std;
#define ll long long
struct node {
	int l, r;
	ll data;
}tree[1600010];
int n, m;
int a[400010];
int lazy[1600010];
void build(int p, int l, int r) {
	tree[p].l = l, tree[p].r = r;
	if (tree[p].l == tree[p].r) {
		tree[p].data = a[l];
		return;
	}
	int mid = (l + r) / 2;
	build(2 * p, l, mid);
	build(2 * p + 1, mid + 1, r);
	tree[p].data = tree[2 * p].data + tree[2 * p + 1].data;
}
void push(int p, int k) {
	tree[p].data += k * (tree[p].r - tree[p].l + 1);
	lazy[p] += k;
}
void down(int p) {
	if (lazy[p]) {
		push(2 * p, lazy[p]);
		push(2 * p + 1, lazy[p]);
		lazy[p] = 0;
	}
}
void change(int p, int l, int r, int k) {
    if (tree[p].l > r || tree[p].r < l) return;
	if (tree[p].l >= l && tree[p].r <= r) {
		push(p, k);
		return;
	}
	down(p);
	int mid = (tree[p].l + tree[p].r) / 2;
	if (r <= mid) change(2 * p, l, r, k);
	else if (l > mid) change(2 * p + 1, l, r, k);
	else {
		change(2 * p, l, mid, k);
		change(2 * p + 1, mid + 1, r, k);
	}
	tree[p].data = tree[2 * p].data + tree[2 * p + 1].data;
}
ll ask(int p, int l, int r) {
    if (tree[p].l > r || tree[p].r < l) return 0;
	if (tree[p].l >= l && tree[p].r <= r) return tree[p].data;
	down(p);
	int mid = (tree[p].l + tree[p].r) / 2;
	if (r <= mid) return ask(2 * p, l, r);
	else if (l > mid) return ask(2 * p + 1, l, r);
	else return ask(2 * p, l, mid) + ask(2 * p + 1, mid + 1, r);
}
int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	build(1, 1, n);
	for (int i = 1; i <= m; ++i) {
		int pos;
		cin >> pos;
		if (pos == 1) {
			int x, y, k;
			cin >> x >> y >> k;
			change(1, x, y, k);
		}
		else if (pos == 2){
			int x;
			cin >> x;
			change(1, 1, 1, x);
		}
		else if (pos == 3) {
			int x;
			cin >> x;
			change(1, 1, 1, -x);
		}
		else if (pos == 4) {
			int x, y;
			cin >> x >> y;
			cout << ask(1, x, y) << endl;
		}
		else if (pos == 5) cout << ask(1, 1, 1) << endl;
	}
	return 0;
}