#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<ll> vec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-5;
const ld pi = acos(-1.0);

struct SegT {
private:
	int sz; vector<vector<ll>> node;
	vector<vector<ll>> rnode;

public:
	SegT(vector<ll> v) {
		int n = v.size();
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1);
		rep(i, n) {
			node[i + sz - 1].push_back(v[i]);
		}
		Rep(i, n, sz) {
			node[i + sz - 1].push_back(0);
		}
		per(i, sz - 1) {
			node[i] = merge(node[2 * i + 1], node[2 * i + 2]);
		}
		rnode.resize(2 * sz - 1);
		rep(i, 2 * sz - 1) {
			rnode[i].resize(node[i].size()+1);
			rep(j, node[i].size()) {
				rnode[i][j + 1] = rnode[i][j] + node[i][j];
			}
		}
	}
	vector<ll> merge(vector<ll>& a, vector<ll> &b) {
		vector<ll> ret;
		int l[2] = {};
		int len = a.size() + b.size();
		rep(i, len) {
			if (l[0] == a.size()) {
				ret.push_back(b[l[1]]); l[1]++;
			}
			else if (l[1] == b.size()) {
				ret.push_back(a[l[0]]); l[0]++;
			}
			else {
				if (a[l[0]] < b[l[1]]) {
					ret.push_back(a[l[0]]); l[0]++;
				}
				else {
					ret.push_back(b[l[1]]); l[1]++;
				}
			}
		}
		return ret;
	}
	ll query(int x,int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (r <= a || b <= l)return 0;
		else if (a <= l && r <= b) {
			int id = lower_bound(node[k].begin(), node[k].end(),x) - node[k].begin();
			ll num = node[k].size() - id;
			//cout << l << " " << r << endl;
			//cout << rnode[k][node[k].size()] - rnode[k][id] - num * x << endl;
			return rnode[k][node[k].size()] - rnode[k][id] - num * x;
		}
		else {
			ll vl = query(x,a, b, k * 2 + 1, l, (l + r) / 2);
			ll vr = query(x,a, b, k * 2 + 2, (l + r) / 2, r);
			return vl + vr;
		}
	}
};

void solve() {
	int n, q; cin >> n >> q;
	vector<ll> a(n);
	rep(i, n) {
		cin >> a[i];
	}
	SegT st(a);
	rep(i, q) {
		int t, l, r, x; cin >> t >> l >> r >> x;
		l--; r--;
		ll ans = st.query(x, l, r+1);
		cout << ans << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(50);
	//init();
	solve();

	//cout << "finish" << endl;
	//stop
		return 0;
}