#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

const int SZ = 1 << 17;

struct segtree{
	vector<ll> dat1, dat2;

	void init(){
		dat1.resize(SZ * 2);
		dat2.resize(SZ * 2);	
		rep(i, SZ * 2) dat1[i] = dat2[i] = 0;
	}
	
	void add(int a, int b, ll x, int k = 0, int l = 0, int r = SZ) {
		if(b <= l || r <= a) return ;
		if(a <= l && r <= b) dat1[k] += x;
		else{
			dat2[k] += (min(b, r) - max(a, l)) * x;
			add(a, b, x, k * 2 + 1, l, (l + r) / 2);
			add(a, b, x, k * 2 + 2, (l + r) / 2, r);
		}
	}

	ll sum(int a, int b, int k = 0, int l = 0, int r = SZ){
		if(b <= l || r <= a) return 0;
		if(a <= l && r <= b) return dat1[k] * (r - l) + dat2[k];
		else{
			ll res = (min(b, r) - max(a, l)) * dat1[k];
			res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
			res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
			return res;
		}
	}
} U, T;

int main() {
	int N, Q; cin >> N >> Q;
	vi a(N); rep(i, N) cin >> a[i];
	vector<pair<int, pii>> query(Q);

	rep(i, Q) {
		int t, l, r, x;
		cin >> t >> l >> r >> x;
		--l;
		query[i] = mp(x, mp(l, r));
	}

	vector<pii> vals, qrs;
	rep(i, N) vals.eb(a[i], i);
	rep(i, Q) qrs.eb(query[i].fi, i);

	sort(ALL(vals));
	reverse(ALL(vals));
	sort(ALL(qrs));
	reverse(ALL(qrs));	

	U.init();
	T.init();

	int now = 0;

	vector<ll> ans(Q);

	for (auto p : qrs) {
		int id = p.se, x = p.fi;
		while (now < N && vals[now].fi >= x) {
			int pos = vals[now].se;
			U.add(pos, pos + 1, 1);;
			T.add(pos, pos + 1, vals[now].fi);
			now++;
		}
		int l = query[id].se.fi, r = query[id].se.se;
		ll v = T.sum(l, r) - x * U.sum(l, r);
		ans[id] = v;
	}

	rep(i, Q) {
		printf("%lld\n", ans[i]);
	}

	return 0;
}