#include <iostream>
#include <vector>
#include <array>
#include <set>
#include <cmath>
#include <algorithm>

using namespace std;

int n, x0;
vector<array<int, 3>> spots;

vector<pair<double, int>> ldegs, rdegs;

struct BIT {
	int n;
	vector<long long> bit;

	BIT(int n) : n(n) {
		bit.assign(n, 0);
	}

	void update_bit(int i, long long v) {
		int diff = v - bit[i];
		for(int j=i; j<n; j+=(j&-j)) bit[j] += diff;
	}

	long long query_bit(int i) {
		long long res = 0;
		for(int j=i; j>0; j-=(j&-j)) res += bit[j];
		return res;
	}
};

int main() {
	cin >> n >> x0;
	spots.resize(n);
	for(auto &[x,y,v] : spots) cin >> x >> y >> v;

	ldegs.clear(), rdegs.clear();
	for(int i=0; i<n; ++i) {
		auto [x,y,v] = spots[i];

		double ldeg = atan2(double(y), double(x));
		double rdeg = atan2(double(y), double(x0-x)); // interior angle

		ldegs.push_back({ldeg, i});
		rdegs.push_back({rdeg, i});
	}

	// we will compress the right to be used in a bit
	sort(rdegs.begin(), rdegs.end());
	for(int i=0; i<n; ++i) {
		auto &[v, j] = rdegs[i];
		v = i+1;
		spots[j][1] = v;
	}
	BIT bit(rdegs.size()+10);

	vector<long long> res(n, -1);
	long long curv = 0;
	sort(ldegs.begin(), ldegs.end());

	for(auto [ld, i] : ldegs) {
		res[i] = bit.query_bit(spots[i][1]);
		bit.update_bit(spots[i][1], spots[i][2]);
	}

	for(auto v : res) cout << v << '\n';

	return 0;
}