#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { long long i,j,k,l,n,m,q,t,nr,poz; ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>q>>l; vector<pair<long long,long long>>v1; vector<pair<long long,long long>>v2; for(long long z=1;z<=q;z++) { cin>>t>>nr>>poz; if(t==1) { v1.push_back({nr,poz}); } else { v2.push_back({nr,poz}); } sort(v1.begin(),v1.end()); sort(v2.begin(),v2.end()); long long total=0,st=0,cons=0; for(long long i=0;i<v1.size();i++) { while(st<v2.size()) { while(v2[i].first<v1[st].first-l && st<v2.size()) { st++; cons=0; } while(v2[st].first<=v1[i].first+l && st<v2.size()) { long long util=v2[st].second-cons; if(util>=v1[i].second) { cons+=util; total+=util; break; } else { total+=util; st++; cons=0; } } } } cout<<total<<'\n'; } return 0; }