#include<bits/stdc++.h>
using namespace std;
const int Mx=1e5+5;
const int N=2e5+5;
int n,k,m;
int ans[Mx];
struct node{
	int a,b,c,cnt;
}s[Mx];
node s1[Mx];
int f[N];
void add(int x,int d){
	while(x<=k){
		f[x]+=d;
		x+=x&-x;
	}
}
int answer(int x){
	int sum=0;
	while(x){
		sum+=f[x];
		x-=x&-x;
	}
	return sum;
}
bool cmp(node x,node y){
	if(x.a==y.a){
		if(x.b==y.b)return x.c<y.c;
		return x.b<y.b;
	}
	return x.a<y.a;
}
bool cmp1(node x,node y){
	if(x.b==y.b)
		return x.c<y.c;
	return x.b<y.b;
}
void CDQ(int l,int r){
	if(l==r)return;
	int mid=(l+r)>>1;
	CDQ(l,mid);CDQ(mid+1,r);
	sort(s+l,s+1+mid,cmp1);
	sort(s+mid+1,s+1+r,cmp1);
	int i,j=l;
	for(i=mid+1;i<=r;i++){
		while(s[i].b>=s[j].b&&j<=mid){
			add(s[j].c,s[j].cnt);
			++j;
		}
		ans[i]+=answer(s[i].c);
	}
	for(i=l;i<j;i++)add(s[i].c,-s[i].cnt);
}
int p[Mx];
int main(){
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
		scanf("%d%d%d",&s1[i].a,&s1[i].b,&s1[i].c);
	sort(s1+1,s1+1+n,cmp);
	int cnt=0;
	for(int i=1;i<=n;i++){
		cnt++;
		if(s1[i].a!=s1[i+1].a||s1[i].b!=s1[i+1].b||s1[i].c!=s1[i+1].c){
			++m;
			s[m]=s1[i];
			s[m].cnt=cnt;
			cnt=0;
		}
	}
	CDQ(1,m);
	for(int i=1;i<=m;i++)p[ans[i]+s[i].cnt-1]+=s[i].cnt;
	for(int i=0;i<n;i++)
		printf("%d\n",p[i]);
	return 0;
}