#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  const int B = 316;
  int n, q; cin >> n >> q;
  int sz = (n + B - 1) / B;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<vector<int> > block(sz);
  REP(i, n) block[i / B].emplace_back(a[i]);
  vector<vector<long long> > rui(sz);
  REP(i, sz) {
    sort(ALL(block[i]));
    int szsz = block[i].size();
    REP(j, szsz) rui[i].emplace_back((j == 0 ? 0 : rui[i].back()) + block[i][j]);
  }
  while (q--) {
    int query, l, r; long long x; cin >> query >> l >> r >> x; --l; --r;
    int l_b = l / B, r_b = r / B;
    long long ans = 0;
    if (l_b == r_b) {
      FOR(i, l, r + 1) ans += max(a[i] - x, 0LL);
    } else {
      FOR(i, l, B * (l_b + 1)) ans += max(a[i] - x, 0LL);
      FOR(i, l_b + 1, r_b) {
        int sz = block[i].size();
        int idx = lower_bound(ALL(block[i]), x) - block[i].begin();
        int cnt = sz - idx;
        ans += rui[i][sz - 1] - (idx == 0 ? 0 : rui[i][idx - 1]) - x * cnt;
      }
      FOR(i, B * r_b, r + 1) ans += max(a[i] - x, 0LL);
    }
    cout << ans << '\n';
  }
  return 0;
}