#include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;

const int N = 1e5 + 10;

struct Point {
    int id, val;
    int x, y;
};

int n, m;
int tr[N], idx[N];

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

int lowbit(int x) {
    return x & -x;
}

int sum(int x) {
    int res = 0;
    for (int i = x; i; i -= lowbit(i)) res += tr[i];
    return res;
}

void add(int x, int v) {
    for (int i = x; i < N; i += lowbit(i)) tr[i] += v;
}

int Cross(Point A, Point B) {
    return A.x * B.y - A.y * B.x;
}

int dis(Point A, Point B) {
    return (A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y);
}

bool cmp(Point A, Point B) {
    return Cross(A, B) > 0;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> n >> m;

    vector<Point> q, p;
    for (int i = 1; i <= n; i++) {
        int x, y, v;
        cin >> x >> y >> v;
        q.pb({i, v, x, y});
        p.pb({i, v, x - m, y});
    }

    sort(q.begin(), q.end(), cmp);
    sort(p.begin(), p.end(), cmp);

    for (int i = 0; i < n; i++) idx[p[i].id] = i + 1;

    vector<int> ans(n + 1);
    int cur = 0;
    
    for (int i = 0; i < n; i++) {
        int pos = q[i].id;
        ans[pos] = cur - sum(idx[pos]);
        add(idx[pos], q[i].val);
        cur += q[i].val;
    }

    for (int i = 1; i <= n; i++) {
        cout << ans[i] << '\n';
    }

    return 0;
}