线段树不知哪里出错了，求调，谢谢大家help

#include<iostream>
#include<algorithm>
#include<bitset>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<cstring>
#include<cmath>
using namespace std;

namespace FastIO {
	inline long long read() {
		char cc = getchar();
		long long ans = 0;
		long long f = 1;
		while (cc < '0' or cc>'9') {
			if (cc == '- ') f = -1;
			cc = getchar();
		}
		while (cc >= '0' and cc <= '9') {
			ans = ans * 10 + cc - '0';
			cc = getchar();
		}
		return ans * f;
	}
}
using namespace FastIO;

namespace SegmentTree {
	struct SegmentTree {
		int l;
		int r;
		long long sum = 0;
		long long add = 0;
	}t[114514*4];
	int a[114514];
	void build(int p, int l, int r) {
		t[p].l = l;
		t[p].r = r;
		if (l == r) {
			t[p].sum = a[l];
			return;
		}
		int mid = (l + r) / 2;
		build(p * 2, l, mid);
		build(p * 2 + 1, mid + 1, r);
		t[p].sum = t[p * 2].sum + t[p * 2 + 1].sum;
	}
	void spread(int p) {
		if (t[p].add) {
			t[p * 2].sum += t[p].add * ( t[p * 2].r - t[p * 2].l + 1);
			t[p * 2 + 1].sum += t[p].add * ( t[p * 2 + 1].r - t[p * 2 + 1].l + 1);
			t[p * 2].add += t[p].add;
			t[p * 2 + 1].add += t[p].add;
			t[p].add = 0;
		}
	}
	void change(int p, int l, int r, int d) {
		if (l <= t[p].l && r >= t[p].r) {
			t[p].sum += (long long)d * (t[p].r - t[p].l + 1);
			t[p].add += d;
			return;
		}
		spread(p);
		int mid = (t[p].l + t[p].r) / 2;
		if (l <= mid) change(p * 2, l, r, d);
		if (l > mid)  change(p * 2 + 1, l, r, d);
		t[p].sum = t[p * 2].sum + t[p * 2 + 1].sum;
	}
	long long ask(int p, int l, int r) {
		if (l <= t[p].l && r >= t[p].r) return t[p].sum;
		spread(p);
		int mid = (t[p].l + t[p].r) / 2;
		long long val = 0;
		if (l <= mid) val += ask(p * 2, l, r);
		if (l > mid) val += ask(p * 2 + 1, l, r);
		return val;
	}
	int n, m;
	int i, j;
	int c;
	int x, y, z;
	int main() {
		
		n = read();
		m = read();
	
		for (i = 1; i <= n; i++) {
		    a[i] = read();
		}
		build(1, 1, n);
		for (i = 1; i <= m; i++) {
			cin >> c;
			if (c == 1) {
				x = read();
				y = read();
				z = read();
				change(1, x, y, z);
			}
			if (c == 2) {
				x = read();
				y = read();
				cout << ask(1, x, y) << endl;
			}
		}
		return 0;
	}
}
int main() {
	return SegmentTree::main();
}