rt，特判了重复

#include <bits/stdc++.h>
#define LB(k) ((k) & -(k))
using namespace std;

struct node { int a, b, c, id; } a[200005], b[200005];
bool operator== (node a, node b) { return a.a == b.a && a.b == b.b && a.c == b.c; }

int n, k, ans[200005], cnt[200005], c[200005];

void read(int &a, int ch = 0) {
    while (!isdigit(ch = getchar()));
    for (a = 0; isdigit(ch); ch = getchar()) a = (a << 3) + (a << 1) + (ch ^ 48);
}
void write(int x) { if (x > 9) write(x / 10); putchar(x % 10 ^ 48); }
bool cmp(node a, node b) { return a.a == b.a ? a.b == b.b ? a.c > b.c : a.b > b.b : a.a > b.a; }
void add(int x) { for (; x <= k; x += LB(x)) c[x]++; }
int query(int x) { int R = 0; for (; x; x -= LB(x)) R += c[x]; return R; }
void clear() { for (int i = 1; i <= k; i++) c[i] = 0; }
void merge(int l, int r, int mid) {
    int i = l, j = mid + 1, pos = l;
    while (i <= mid && j <= r) {
        if (a[i].b <= a[j].b) b[pos++] = a[i++];
        else b[pos++] = a[j++];
    }
    while (i <= mid) b[pos++] = a[i++];
    while (j <= r) b[pos++] = a[j++];
    for (int i = l; i <= r; i++) a[i] = b[i];
}
void solve(int l, int r) {
    if (l == r) return;
    int mid = (l + r) >> 1;
    solve(l, mid), solve(mid + 1, r);
    for (int i = l, j = mid + 1; i <= mid; i++) {
        while (j <= r && a[i].b >= a[j].b) add(a[j++].c);
        ans[a[i].id] += query(a[i].c);
    }
    int c = 0;
    while (mid - c >= l && a[mid - c] == a[mid + 1]) c++;
    for (int i = mid + 1; i <= r; i++) {
        if (a[i] == a[mid + 1]) ans[a[i].id] += c;
        else break;
    }
    clear(), merge(l, r, mid);
}
int main() {
    read(n), read(k);
    for (int i = 1; i <= n; i++) {
        read(a[i].a), read(a[i].b), read(a[i].c);
        a[i].id = i;
    }
    sort(a + 1, a + n + 1, cmp);
    solve(1, n);
    for (int i = 1; i <= n; i++) cnt[ans[i]]++;
    for (int i = 0; i < n; i++) write(cnt[i]), putchar(10);
    return 0;
}