# include <bits/stdc++.h>
# include <atcoder/modint>
# include <atcoder/segtree>
# include <atcoder/lazysegtree>
# include <atcoder/dsu>
# include <atcoder/scc>
# include <atcoder/string>
# include <atcoder/twosat>
# include <atcoder/math>
# include <atcoder/convolution>
//# include <regex>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<long long> vl;
typedef vector<vector<long long>> vvl;
typedef vector<vector<vector<long long>>> vvvl;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,m,n) for(int i=m;i<n;i++)
#define repl(i,n) for(ll i=0;i<n;i++)
#define repsl(i,m,n) for(ll i=m;i<n;i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define repsr(i,m,n) for(int i=n-1;i>=m;i--)
#define replr(i,n) for(ll i=n-1;i>=0;i--)
#define repslr(i,m,n) for(ll i=n-1;i>=m;i--)
#define sksort(x) sort(x.begin(), x.end())
#define sksortr(x) sort(x.rbegin(), x.rend())
#define disp(x) cout << x << endl
#define disps(x) cout << x << " "
#define dispe cout << endl
#define dispv(x) for(ll xqzj=0;xqzj<(ll)x.size();xqzj++){disps(x[xqzj]);}dispe
#define dispvv(x) for(ll xqzi=0;xqzi<(ll)x.size();xqzi++){dispv(x[xqzi]);}
#define dispvm(x) for(ll xqzj=0;xqzj<(ll)x.size();xqzj++){disps(x[xqzj].val());}dispe
#define dispvvm(x) for(ll xqzi=0;xqzi<(ll)x.size();xqzi++){dispvm(x[xqzi]);}
#define dispy cout << "Yes" << endl
#define dispn cout << "No" << endl
#define dispyn(x) if(x)dispy;else dispn
#define dispd cout << std::setprecision(20)
#define inp(x) int x;cin>>x
#define inpl(x) ll x;cin>>x
#define inps(x) string x;cin>>x
#define allv(x)  (x).begin(),(x).end()
#define allrv(x)  (x).rbegin(),(x).rend()
#define imax(x,y) x=max(x,y)
#define imin(x,y) x=min(x,y)
#define perm(x,y) vi permv(x);rep(permi,x)permv[permi]=permi;do y while(next_permutation(allv(permv)))
template <class T>
using priority_queue_asc = std::priority_queue<T,std::vector<T>,std::greater<T>>;
using mint = atcoder::modint998244353;
//using mint = atcoder::modint1000000007;

struct S {
    ll val;
    int size;
};

struct F {
    int val;
};

S op(S l, S r){
    return {
        (l.size?l.val:0LL)+(r.size?r.val:0LL),
        l.size+r.size
    };
}

S e(){
    return {0,0};
}

S mapping(F f, S s){
    return {s.val+(ll)s.size*f.val,s.size};
}

F composition(F f_new, F f_old){
    return {f_new.val+f_old.val};
}

F id(){
    return {0};
}

int main(){
    inp(n);
    inp(q);
    vector<S> a(n);
    vector<pair<int,int>> s(n);
    rep(i,n){
        cin>>a[i].val;
        a[i].size=1;
        s[i].first=a[i].val;
        s[i].second=i;
    }
    sksort(s);
    atcoder::lazy_segtree<S,op,e,F,mapping,composition,id> seg(a);
    vector<pair<pair<int,int>,pair<int,int>>> vp(q);
    rep(i,q){
        inp(t);
        cin>>vp[i].second.first>>vp[i].second.second>>vp[i].first.first;
        vp[i].first.second=i;
    }
    sksort(vp);
    vector<pair<int,ll>> ans(q);
    int b=0;
    int x=0;
    rep(i,q){
        seg.apply(0,n,{b-vp[i].first.first});
        while(x!=n&&s[x].first<=vp[i].first.first){
            seg.set(s[x].second,{0,0});
            x++;
        }
        b=vp[i].first.first;
        ans[i].first=vp[i].first.second;
        ans[i].second=seg.prod(vp[i].second.first-1,vp[i].second.second).val;
    }
    sksort(ans);
    rep(i,q)disp(ans[i].second);
}