RT , 不明白为什么会WA

#include <bits/stdc++.h>
using namespace std;
#define lowbit(x) x &(-x)
#define Mid int mid = (l + r) >> 1
#define _ (int)2e5 * (1 << 5)
int lc[_ << 4], rc[_ << 4], sum[_ << 4];
int root[_ << 4], cnt;
int n, k;
struct node
{
    int a, b, c;
} e[_];
bool cmp1(node a, node b)
{
    if (a.a != b.a)
        return a.a < b.a;
    else if (a.b != b.b)
        return a.b < b.b;
    else
        return a.c < b.c;
}
void pushup(int p)
{
    sum[p] = sum[lc[p]] + sum[rc[p]];
}
void modify(int &p, int l, int r, int x, int v)
{
    if (!p)
        p = ++cnt;
    if (l == r)
    {
        sum[p] += v;
        return;
    }
    Mid;
    if (x <= mid)
        modify(lc[p], l, mid, x, v);
    else
        modify(rc[p], mid + 1, r, x, v);
    pushup(p);
}
int query(int p, int l, int r, int x, int y)
{
    if (!p)
        return 0;
    if (x <= l && r <= y)
        return sum[p];
    Mid, ans = 0;
    if (x <= mid)
        ans += query(lc[p], l, mid, x, y);
    if (y > mid)
        ans += query(rc[p], mid + 1, r, x, y);
    return ans;
}
void add(node x)
{
    for (int i = x.b; i <= k; i += lowbit(i))
        modify(root[i], 1, k, x.c, 1);
}
int Sum(node x)
{
    int ans = 0;
    for (int i = x.b; i; i -= lowbit(i))
        ans += query(root[i], 1, k, 1, x.c);
    return ans;
}
int ans[_];
int main()
{
    //freopen("brute.out", "w", stdout);
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        cin >> e[i].a >> e[i].b >> e[i].c;
    }
    sort(e + 1, e + n + 1, cmp1);
    for (int i = 1; i <= n; i++)
    {
        // cout << e[i].a << " " << e[i].b << " " << e[i].c << endl;
        // cout << i << " " << Sum(e[i]) << endl;
        ans[Sum(e[i])]++;
        add(e[i]);
    }
    for (int i = 0; i < n; i++)
        cout << ans[i] << endl;
    return 0;
}