#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}
int s, t;
int n;
typedef long double ld;
int x;
struct pt{
    ll x, y;
    pt() {
        x = y = 0;
    }
    pt(ll xx, ll yy) {
        x = xx;
        y = yy;
    }
};
const int maxN = 1e5 + 10;
int id[maxN][2];
pt st;
pt a[maxN];
ll cost[maxN];
bool cmp(pt a, pt b) {
    ll difAx = a.x - st.x;
    ll difAy = a.y - st.y;
    ll difBx = b.x - st.x;
    ll difbY = b.y - st.y;
    return difAx * difbY > difAy * difBx;
}
ll fenw[maxN];
int ans[maxN];
ll get(int x) {
    ll s = 0;
    while (x > 0) {
        s += fenw[x];
        x &= (x - 1);
    }
    return s;
}
void upd(int x, ll by) {
    while (x < maxN) {
        fenw[x] += by;
        x = (x | (x - 1)) + 1;
    }
}
void solve() {
    cin >> n >> x;
    for (int i = 1; i <= n; i++) {
        pt t;
        cin >> t.x >> t.y;
        a[i] = t;
        cin >> cost[i];
    }
    map<pair<ll,ll>,int> s;
    for (int i = 1; i <= n; i++) {
        s[{a[i].x, a[i].y}] = i;
    }
    for (int z = 0; z < 2; z++) {
        if (z == 0) {
            st.x = 0;
            st.y = 0;
        }
        else {
            st.x = x;
            st.y = 0;
        }
        vector<pt> T;
        for (int i = 1; i <= n; i++) {
            T.emplace_back(a[i]);
        }
        sort(T.begin(), T.end(), cmp);
        for (int i = 0; i < T.size(); i++) {
            id[s[{T[i].x, T[i].y}]][z] = i;
        }
    }
    vector<int> S(n);
    iota(S.begin(), S.end(), 1);
    sort(S.begin(), S.end(), [&](int x, int y) {
        return id[x][1] > id[y][1];
    });
//    for (int i = 1; i <= n; i++) {
//        cout << id[i][0] << " " << id[i][1] << " ??? " << endl;
//    }
    for (int u : S) {
        ans[u] = get(id[u][0] + 1);
        upd(id[u][0] + 1, cost[u]);
    }
    for (int i = 1; i <= n; i++) cout << ans[i] << '\n';

}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}