照着深进打的，找不到问题

#include <bits/stdc++.h>
using namespace std;
#define N 1002
#define M_ ((L + R) >> 1)
#define U_ (u << 1)
#define c_i const int &
#define c_l const long long &
long long a[N], w[N * 4], tag[N * 4], n, m;
bool InRange(c_i L, c_i R, c_i l, c_i r) {return l <= R && L <= r;}
bool OutRange(c_i L, c_i R, c_i l, c_i r) {return L > r || R < l;}
void make_tag(c_i u, c_i len, c_l x) {tag[u] += x, w[u] += len * x; return;}
void pushup(c_i u) {w[u] = w[U_] + w[U_ + 1]; return;}
void pushdown(c_i u, c_i L, c_i R) {make_tag(U_, M_ - L + 1, tag[u]), make_tag(U_ + 1, R - M_, tag[u]), tag[u] = 0; return;}
void build(c_i u, c_i L, c_i R) {
    if (L == R) {w[u] = a[L]; return;}
    build(U_, L, M_);
    build(U_ + 1, M_ + 1, R);
    pushup(u);
    return;
}
long long query_(c_i u, c_i L, c_i R, c_i p) {
    if (L == R) return w[u];
    if (M_ >= p) return query_(U_, L, M_, p);
    else return query_(U_ + 1, M_ + 1, R, p);
}
void update_(c_i u, c_i L, c_i R, c_i p, c_l x) {
    if (L == R) {w[u] = x; return;}
    if (M_ >= p) update_(U_, L, M_, p, x);
    else update_(U_ + 1, M_ + 1, R, p, x);
    pushup(u);
    return;
}
long long query(c_i u, c_i L, c_i R, c_i l, c_i r) {
	if (InRange(L, R, l, r)) return w[u];
	if (!OutRange(L, R, l, r)) {
		pushdown(u, L, R);
		return query(U_, L, M_, l, r) + query(U_ + 1, M_ + 1, R, l, r);
	} else return 0;
}
void update(c_i u, c_i L, c_i R, c_i l, c_i r, c_l x) {
    if (InRange(L, R, l, r)) {make_tag(u, R - L + 1, x); return;}
	if (!OutRange(L, R, l, r)) {
		pushdown(u, L, R);
		update(U_, L, M_, l, r, x);
		update(U_ + 1, M_ + 1, R, l, r, x);
		pushup(u);
		return;
	}
	return;
}
int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%d", a + i);
	build(1, 1, n);/*
	for (int i = 1; i <= 10; i++) printf("%d ", w[i]);
	putchar(10);
	for (int i = 1; i <= 10; i++) printf("%d ", tag[i]);
	putchar(10);*/
	while (m--) {
		int p, x, y;
		long long k;
		scanf("%d", &p);
		if (p == 1) {
			scanf("%d %d %lld", &x, &y, &k);
			update(1, 1, n, x, y, k);/*
			for (int i = 1; i <= 10; i++) printf("%d ", w[i]);
			putchar(10);
			for (int i = 1; i <= 10; i++) printf("%d ", tag[i]);
			putchar(10);*/
		} else {
			scanf("%d %d", &x, &y);
			printf("%lld\n", query(1, 1, n, x, y));
		}
	}
    return 0;
}