This documentation is automatically generated by online-judge-tools/verification-helper
#define PROBLEM "https://judge.yosupo.jp/problem/rectangle_sum"
#include<bits/stdc++.h>
using namespace std;
#define call_from_test
#include "../../vector/compress.cpp"
#include "../../segtree/count/dynamic_offline.cpp"
#undef call_from_test
#ifdef SANITIZE
#define IGNORE
#endif
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n,q;
cin>>n>>q;
vector<int> xs(n),ys(n),ws(n);
for(int i=0;i<n;i++) cin>>xs[i]>>ys[i]>>ws[i];
auto vs=compress(xs);
auto idx=
[&](int x){return lower_bound(vs.begin(),vs.end(),x)-vs.begin();};
using ll = long long;
RangeCount<int, ll> seg(vs.size());
for(int i=0;i<n;i++)
seg.preupdate(idx(xs[i]),ys[i]);
seg.build();
for(int i=0;i<n;i++)
seg.update(idx(xs[i]),ys[i],ws[i]);
for(int i=0;i<q;i++){
int l,d,r,u;
cin>>l>>d>>r>>u;
cout<<seg.query(idx(l),idx(r),d,u)<<"\n";
}
cout<<flush;
return 0;
}
#line 1 "test/yosupo/rectangle_sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/rectangle_sum"
#include<bits/stdc++.h>
using namespace std;
#define call_from_test
#line 1 "vector/compress.cpp"
#line 3 "vector/compress.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
template<typename V>
V compress(V vs){
sort(vs.begin(),vs.end());
vs.erase(unique(vs.begin(),vs.end()),vs.end());
return vs;
}
template<typename T>
map<T, int> dict(const vector<T> &vs){
map<T, int> res;
for(int i=0;i<(int)vs.size();i++)
res[vs[i]]=i;
return res;
}
map<char, int> dict(const string &s){
return dict(vector<char>(s.begin(),s.end()));
}
template<typename T>
vector<T> compressed(vector<T> vs){
auto dc=dict(compress(vs));
for(auto &v:vs) v=dc[v];
return vs;
}
//END CUT HERE
#ifndef call_from_test
//INSERT ABOVE HERE
signed main(){
return 0;
}
#endif
#line 1 "segtree/count/dynamic_offline.cpp"
#line 3 "segtree/count/dynamic_offline.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
template<typename Key,typename T>
struct RangeCount{
struct BIT{
vector<T> dat;
BIT(int n){dat.assign(++n,0);}
T sum(int k){
T res=0;
for(;k;k-=k&-k) res+=dat[k];
return res;
}
void add(int k,T v){
for(++k;k<(int)dat.size();k+=k&-k) dat[k]+=v;
}
};
int n;
vector< vector<Key> > val;
vector<BIT> dat;
RangeCount(int n):n(n){
val.assign(n<<1,vector<Key>());
dat.reserve(n<<1);
}
void preupdate(int a,Key x){
a+=n;
while(a){
val[a].emplace_back(x);
a>>=1;
}
}
void build(){
for(int i=0;i<n*2;i++){
auto &vs=val[i];
sort(vs.begin(),vs.end());
vs.erase(unique(vs.begin(),vs.end()),vs.end());
dat.emplace_back(vs.size());
}
}
void update(int a,Key x,T z){
a+=n;
while(a){
auto &vs=val[a];
int k=lower_bound(vs.begin(),vs.end(),x)-vs.begin();
dat[a].add(k,z);
a>>=1;
}
}
T calc(int k,Key x,Key y){
auto &vs=val[k];
int p=lower_bound(vs.begin(),vs.end(),x)-vs.begin();
int q=lower_bound(vs.begin(),vs.end(),y)-vs.begin();
return dat[k].sum(q)-dat[k].sum(p);
}
// [a, b) * [x, y)
T query(int a,int b,Key x,Key y){
T res=0;
for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1){
if(l&1) res+=calc(l++,x,y);
if(r&1) res+=calc(--r,x,y);
}
return res;
}
};
//END CUT HERE
#ifndef call_from_test
//INSERT ABOVE HERE
//END CUT HERE
signed main(){
return 0;
}
#endif
#line 9 "test/yosupo/rectangle_sum.test.cpp"
#undef call_from_test
#ifdef SANITIZE
#define IGNORE
#endif
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n,q;
cin>>n>>q;
vector<int> xs(n),ys(n),ws(n);
for(int i=0;i<n;i++) cin>>xs[i]>>ys[i]>>ws[i];
auto vs=compress(xs);
auto idx=
[&](int x){return lower_bound(vs.begin(),vs.end(),x)-vs.begin();};
using ll = long long;
RangeCount<int, ll> seg(vs.size());
for(int i=0;i<n;i++)
seg.preupdate(idx(xs[i]),ys[i]);
seg.build();
for(int i=0;i<n;i++)
seg.update(idx(xs[i]),ys[i],ws[i]);
for(int i=0;i<q;i++){
int l,d,r,u;
cin>>l>>d>>r>>u;
cout<<seg.query(idx(l),idx(r),d,u)<<"\n";
}
cout<<flush;
return 0;
}