#include <bits/stdc++.h>
using namespace std;
inline void debug(){
    #ifndef mrclr
    freopen("C:/Users/52419/Desktop/icpc/debug.in", "r", stdin);
    #endif
}

typedef long long LL;
const int N = 1e5 + 10;
int n, x, k[N]; LL tot, ans[N];

#define lowbit(x) (x & -x)
LL bit[N];
inline void upd(const int x, const LL v){
    for(int i = x; i <= n; i += lowbit(i)) bit[i] += v;
}
inline LL que(const int x){
    LL res = 0; for(int i = x; i; i -= lowbit(i)) res += bit[i];
    return res;
}

int main(){ //debug();
    cin >> n >> x;

    auto angle = [&] (array<int, 4> a, array<int, 4> b) {
        auto [x1, y1, val1, i1] = a;
        auto [x2, y2, val2, i2] = b;
        return atan2(y2 - y1,x2 - x1);
    };

    vector<array<int, 4>> arr(n);
    for (int i = 0; i < n; i++) {
        cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
        arr[i][3] = i;
    }

    sort(begin(arr), end(arr), [&](array<int, 4> a, array<int, 4> b) {
        return angle(a, {0, 0, 0, 0}) > angle(b, {0, 0, 0, 0});
    });

    for(int i = 0; i < n; i++)
        k[arr[i][3]] = i + 1;
    
    sort(begin(arr), end(arr), [&](array<int, 4> a, array<int, 4> b) {
        return angle(a, {x, 0, 0, 0}) > angle(b, {x, 0, 0, 0});
    });

    for(int i = 0; i < n; i++){
        ans[arr[i][3]] = tot - que(k[arr[i][3]]);
        upd(k[arr[i][3]], arr[i][2]), tot += arr[i][2];
    }
    
    for(int i = 0; i < n; i++){
        cout<< ans[i] <<endl;
    }

    return 0;
}