#include<cstdio>

 #include<cstdlib>

 #include<algorithm>

 #include<cstring>

 #include<iostream>

 using namespace std;

 const int D=3e6;

 char in[D],*I=in,out[D],*O=out;

 inline int gint(){

     int x=;for(;*I<||*I>;++I);

     for(;*I>&&*I<;++I)x=*x+*I-;

     return x;

 }

 inline void print(int x){

     char tmp[],*t=tmp;

     if(!x)*t++=;

     for(;x;x/=)*t++=x%+;

     for(;t--!=tmp;*O++=*t);

     *O++='\n';

 }

 const int Maxn= + ;

 int C[Maxn*],ans[Maxn],N,K,n=;

 struct Node{

     int a,b,c,s,ans;

     inline bool operator==(const Node&rhs)const{

         return a==rhs.a&&b==rhs.b&&c==rhs.c;

     }

     inline bool operator!=(const Node&rhs)const{

         return !(*this==rhs);

     }

     void init(){a=gint(),b=gint(),c=gint();}

 }p[Maxn],q[Maxn];

 inline void Add(int x,const int&y){

     for(;<x&&x<=K;x+=x&-x)C[x]+=y;

 }

 inline int Query(int x){

     int ret=;

     for(;<x&&x<=K;x-=x&-x)ret+=C[x];

     return ret;

 }

 inline bool cmp1(const Node&x,const Node&y){

     if(x.a!=y.a)return x.a<y.a;

     if(x.b!=y.b)return x.b<y.b;

     return x.c<y.c;

 }

 inline bool cmp2(const Node&x,const Node&y){

     if(x.b!=y.b)return x.b<y.b;

     return x.c<y.c;

 }

 void CDQ(int l,int r){

     if(l==r)return;

     int mid=(l+r)>>;

     CDQ(l,mid);CDQ(mid+,r);

     int i=l;

     for(int j=mid+;j<=r;j++){

         for(;i<=mid&&p[i].b<=p[j].b;i++)

             Add(p[i].c,p[i].s);

         p[j].ans+=Query(p[j].c);

     }

     for(int j=l;j<i;j++)Add(p[j].c,-p[j].s);

     merge(p+l,p+mid+,p+mid+,p+r+,q,cmp2);

     memcpy(p+l,q,sizeof(p[])*(r-l+));

 }

 void init(){

     N=gint(),K=gint();

     for(int i=;i<=N;i++)q[i].init();

     sort(q+,q+N+,cmp1);

     for(int cnt=,i=;i<=N;i++,cnt++){

         if(q[i]!=q[i+]){p[++n]=q[i];p[n].s=cnt;cnt=;}

     }

 }

 int main(){

     freopen("in.txt","r",stdin);

     freopen("out.txt","w",stdout);

     fread(I,,D,stdin);

     init();

     CDQ(,n);

     for(int i=;i<=n;i++)ans[p[i].ans+p[i].s-]+=p[i].s;

     for(int i=;i<N;i++)print(ans[i]);

     *--O=;

     return puts(out),;

 }