rt,70pts,TLE * 3

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int N = 2e5 + 5;
struct node {
	int l, r;
	ll s;
} tr[4 * N];
int w[N];
void push_up(int u) {
	tr[u].s = tr[u << 1].s + tr[u << 1 | 1].s;
}
inline void build(int u, int l, int r) {
	tr[u].l = l, tr[u].r = r;
	if (l == r) tr[u].s = w[l];
	else {
		int mid = (l + r) >> 1;
		build(u << 1, l, mid);
		build(u << 1 | 1, mid + 1, r);
		push_up(u);
	}
}
ll query(int u, int l, int r) {
//	cout << "u : " << u << " l : " << l << " r : " << r << " ul : " << tr[u].l << " ur : " << tr[u].r << "\n";
	if (l <= tr[u].l && r >= tr[u].r) return tr[u].s;
	else {
		int mid = (tr[u].l  + tr[u].r) >> 1;
		if (r <= mid) return query(u << 1, l, r);
		if (l > mid) return query(u << 1 | 1, l, r);
		ll left = query(u << 1, l, r);
		ll right = query(u << 1 | 1, l, r);
		return left + right;
	}
}
inline void change(int u, int l, int r, int x) {
	if (tr[u].l == tr[u].r) {
		tr[u].s += x;
		return;
	}
	int mid = (tr[u].l + tr[u].r) >> 1;
	if (r <= mid) change(u << 1, l, r, x);
	else if (l > mid) change(u << 1 | 1, l, r, x);
	else {
		change(u << 1, l, mid, x);
		change((u << 1) | 1, mid + 1, r, x);
	}
	push_up(u);
}

int n, q;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> w[i];
	build(1, 1, n);
	while (q--) {
		int l, r, t;
		cin >> t >> l >> r;
		if (t == 1) {
			int k;
			cin >> k;
			change(1, l, r, k);
		} else cout << query(1, l, r) << "\n";
	}
	return 0;
}

(码风不好，模版不知道抄的谁的)