#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}
template<typename T>
class BIT{
private:
	int n;
	vector<T> dat;
	T init;
public:
	BIT(int x){
		n = x;
		init = 0; //書き換えする
		dat = vector<T>(n+1);
		for(int i = 0; i < n+1; i++){
			dat[i] = init;
		}
		return;
	}

	inline T func(T x, T y){
		return x+y; //書き換えする
	}

	T query(int i){ //[0,i)へのクエリ
		T s = 0;
		while(i > 0){
			s = func(s, dat[i]);
			i -= i&-i;
		}
		return s;
	}

	void add(int i, T x){
		i++;
		while(i <= n){
			dat[i] = func(dat[i],x);
			i += i & -i;
		}
	}
};


int main()
{
	ios_init();
	int n, q;
	while(cin >> n >> q) {
		vector<LL> a(n);
		REP(i, n) cin >> a[i];
		vector<vector<int>> lv(n + 1);
		vector<vector<int>> rv(n + 1);
		vector<LL> xv(q);

		REP(i, q) {
			int t;
			int l, r;
			cin >> t >> l >> r >> xv[i];
			l--;
			lv[l].push_back(i);
			rv[r].push_back(i);
		}

		auto za = a;
		sort(ALL(za));
		za.erase(unique(ALL(za)), za.end());
		BIT<LL> bit(SZ(za) + 1);
		BIT<LL> cnt(SZ(za) + 1);
		vector<LL> ans(q);
		LL sum = 0;
		REP(i, n + 1) {
			for(auto&& l : lv[i]) {
				DEBUG(l);
				int k = lower_bound(ALL(za), xv[l]) - za.begin();
				DEBUG(k);
				LL v = (sum - bit.query(k)) - xv[l] * (i - cnt.query(k));
				DEBUG(v);
				DEBUG(xv[l]);
				ans[l] -= v;
			}

			for(auto&& r : rv[i]) {
				DEBUG(r);
				int k = lower_bound(ALL(za), xv[r]) - za.begin();
				DEBUG(k);
				LL v = (sum - bit.query(k)) - xv[r] * (i - cnt.query(k));
				DEBUG(i - cnt.query(k + 1));
				DEBUG(v);
				DEBUG(xv[r]);
				ans[r] += v;
			}

			if(i != n) {
				int k = lower_bound(ALL(za), a[i]) - za.begin();
				bit.add(k, a[i]);
				cnt.add(k, 1);
				sum += a[i];
			}
		}
		REP(i, q) {
			cout << ans[i] << endl;
		}
	}
	return 0;
}