#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;
using ll = long long;

struct segtree {
    int n;
    vector<vector<ll>> a;
    vector<vector<ll>> s;
    segtree(int mx) {
        n = 1;
        while (n < mx) n <<= 1;
        a.resize(n*2);
        s.resize(n*2, vector<ll>(1));
    }
    void set(int i, ll x) {
        a[n+i] = {x};
        s[n+i].push_back(x);
    }
    void init() {
        for (int i = n-1; i >= 1; --i) {
            int l = i<<1, r = l|1;
            merge(a[l].begin(), a[l].end(), a[r].begin(), a[r].end(), back_inserter(a[i]));
            s[i] = vector<ll>(a[i].size()+1);
            rep(j, a[i].size()) s[i][j+1] = s[i][j]+a[i][j];
        }
    }
    
    pair<int, ll> get(int i, ll x) {
        int n = a[i].size();
        int j = lower_bound(a[i].begin(), a[i].end(), x) - a[i].begin();
        return {n-j, s[i][n]-s[i][j]};
    }
    
    pair<int, ll> solve(int l, int r, ll x) {
        l += n; r += n;
        int num = 0; ll sum = 0;
        while (l < r) {
            if (l&1) {
                auto [tnum, tsum] = get(l, x);
                num += tnum, sum += tsum;
                l++;
            }
            if (r&1) {
                r--;
                auto [tnum, tsum] = get(r, x);
                num += tnum, sum += tsum;
            }
            l >>= 1; r >>= 1;
        }
        return {num, sum};
    }
};

int main() {
    int n, q;
    cin >> n >> q;
    
    segtree t(n);
    rep(i, n) {
        ll a;
        cin >> a;
        t.set(i, a);
    }
    t.init();
    
    rep(qi, q) {
        int type, l, r; ll x;
        cin >> type >> l >> r >> x;
        --l;
        auto [num, sum] = t.solve(l, r, x);
        ll ans = sum - num*x;
        cout << ans << '\n';
    }
    
    return 0;
}