#include <bits/stdc++.h>

///////////////////////////
// Range Sum Query (BIT) //
///////////////////////////

class RSumQBIT {
private:
	std::vector<int64_t> container_;

	int64_t getHelper(const int index) const
	{
		if (index < 0) return 0;
		if ((int)(container_.size()) <= index) return container_.back();
		int64_t sum{};
		for (int add_place{index}; add_place > 0; add_place -= add_place & -add_place)
			sum += container_[add_place];
		return sum;
	}

public:
	RSumQBIT(const int array_size)
		: container_(array_size + 1) {}
	// indexは0-indexed
	void update(const int index, const int64_t added)
	{
		for (int update_place{index + 1}; update_place < (int)(container_.size()); update_place += update_place & -update_place)
			container_[update_place] += added;
	}
	// left,rightは0-indexed、[left, right)の半開区間
	int64_t get(const int left, const int right) const
	{
		return -getHelper(left) + getHelper(right);
	}
};

int main()
{
	int N, Q;
	scanf("%d%d", &N, &Q);
	std::vector<std::array<int64_t, 5>> queries(N + Q);
	// {1, l, r, x}
	// {2, index, a}
	for (int64_t i{}; i < N; i++)
	{
		int64_t a;
		scanf("%lld", &a);
		queries[i] = {2ll, i, i, a, i};
	}
	for (int i{}; i < Q; i++)
	{
		int64_t com, l, r, x;
		scanf("%lld%lld%lld%lld", &com, &l, &r, &x);
		l--;
		queries[N + i] = {com, l, r, x, i};
	}

	std::sort(queries.begin(), queries.end(), [](auto& a, auto& b) { return a[3] > b[3]; });

	RSumQBIT sum(N), exist(N);
	std::vector<int64_t> ans(Q);
	for (auto& query: queries)
	{
		// for (int i{}; i < N; i++)
		// 	printf("%lld ", sum.get(i, i + 1));
		// putchar('\n');
		// for (int i{}; i < N; i++)
		// 	printf("%lld ", exist.get(i, i + 1));
		// putchar('\n');
		if (query[0] == 1)
			ans[query[4]] = sum.get(query[1], query[2]) - exist.get(query[1], query[2]) * query[3];
		else
		{
			sum.update(query[1], query[3]);
			exist.update(query[1], 1);
		}
	}
	for (auto& e: ans)
		printf("%lld\n", e);

	return 0;
}