#include #pragma GCC optimize("Ofast") #define _GLIBCXX_DEBUG using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=2167167167167167167; const int INF=2100000000; const ll mod=998244353; #define rep(i,a) for (ll i=0;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} template void vec_out(vector &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout< struct segment_tree{ int _n,size; std::vector seg; int ceil_pow2(int a){ int b=1; while(a>b){ b<<=1; } return b; } void update(int k){seg[k]=op(seg[k*2],seg[k*2+1]);}; segment_tree(int n) :_n(n){ size=ceil_pow2(n); seg=std::vector(size*2,e()); } segment_tree(std::vector &p) :_n((int) p.size()){ size=ceil_pow2(_n); seg=std::vector(size*2,e()); for(int i=0;i<_n;i++) seg[i+size]=p[i]; for(int i=size-1;i>0;i--) update(i); } void set(int ind,T val){ assert(0<=ind&&ind<_n); ind+=size; seg[ind]=val; while(ind!=1){ ind>>=1; update(ind); } } void addl(int ind,T val){ set(ind,op(get(ind),val)); } void addr(int ind,T val){ set(ind,op(val,get(ind))); } T get(int ind){ assert(0<=ind&&ind<_n); return seg[ind+size]; } T query(int l,int r){ assert(0<=l&&l<=r&&r<=_n); T l_val=e(); T r_val=e(); l+=size,r+=size; while(l>=1; l>>=1; } return op(l_val,r_val); } template int max_right(int l) { return max_right(l, [](T x) { return f(x); }); } template int max_right(int l, F f) { assert(0<=l&&l<=_n); assert(f(e())); if(f(query(l,_n))) return _n; T val=e(); l+=size; while(true){ while(l%2==0) l>>=1; if(!f(op(val,seg[l]))){ while(l int min_left(int r) { return min_left(r, [](T x) { return f(x); }); } template int min_left(int r, F f) { assert(0 <= r && r <= _n); assert(f(e())); if (r == 0) return 0; r += size; T sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!f(op(seg[r], sm))) { while (r < size) { r = (2 * r + 1); if (f(op(seg[r], sm))) { sm = op(seg[r], sm); r--; } } return r + 1 - size; } sm = op(seg[r], sm); } while ((r & -r) != r); return 0; } }; } using po167::segment_tree; using F= pair; F op(F a,F b){return {a.first+b.first,a.second+b.second};} F e(){return {0,0};} void solve(); // oddloop int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; //cin>>t; rep(i,t) solve(); } void solve(){ int N,Q; cin>>N>>Q; vector A(N+Q); rep(i,N) cin>>A[i]; segment_tree seg(N); vector L(Q),R(Q),ans(Q); rep(i,Q){ int tmp; cin>>tmp>>L[i]>>R[i]>>A[N+i]; L[i]--; } vector order(N+Q); rep(i,N+Q) order[i]=i; sort(all(order),[&](int l,int r){ return A[l]>A[r]; }); rep(i,Q+N){ int ind=order[i]; if(ind