#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long op(long long a, long long b) { return a + b; }
long long e() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<long long>a(n), b(n, 1);
	rep(i, n)cin >> a[i];
	segtree<long long, op, e>seg(a);
	segtree<long long, op, e>seg2(b);
	vector<long long>ans(q);
	vector<array<int, 4>>eve;
	rep(i, n) {
		eve.push_back({ (int)a[i],INF,i,i });
	}
	rep(i, q) {
		int t, l, r, x; cin >> t >> l >> r >> x;
		eve.push_back({ x,i,l - 1,r - 1 });
	}
	sort(all(eve));
	rep(_, n + q) {
		if (INF == eve[_][1]) {
			int idx = eve[_][2];
			seg.set(idx, 0);
			seg2.set(idx, 0);
		}
		else {
			long long get = seg.prod(eve[_][2], eve[_][3] + 1);
			get -= seg2.prod(eve[_][2], eve[_][3] + 1) *eve[_][0];
			int idx = eve[_][1];
			ans[idx] = get;
		}
	}
	rep(i, q)cout << ans[i] << endl;
	return 0;
}