#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
#define ld long double
using namespace std;

const int N=1e5+10;
struct zy{int x,y,v,id;ld p;}a[N];
ll f[N],g[N];
int b[N];
int n,X,i,j,x;
ll s;

inline int read(){
	int x=0,z=1; char c=getchar(); if (c=='-') z=-1;
	while(c<'0'||c>'9'){c=getchar(); if (c=='-') z=-1;}
	while('0'<=c&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*z;
}
inline int cmp(zy x,zy y){return x.p<y.p;}
int lb(int x){return x&-x;}
inline ll ask(int x){
	ll s=0;
	for(int i=x;i;i-=lb(i)) s+=g[i];
	return s;
}
inline void ad(int x,int v){
	for(int i=x;i<=n;i+=lb(i)) g[i]+=v;
}
int main(){
	n=read(); X=read();
	for(i=1;i<=n;++i){
		a[i].x=read(); a[i].y=read(); a[i].v=read(); a[i].id=i;
		a[i].p=atan2(a[i].y,a[i].x);
	}
	
	sort(a+1,a+n+1,cmp);
	for(i=n;i>=1;--i)
		b[a[i].id]=n-i+1;
	
	for(i=1;i<=n;++i)
		a[i].p=atan2(a[i].y,a[i].x-X);
	
	s=0;
	sort(a+1,a+n+1,cmp);
	for(i=n;i>=1;--i){
		x=a[i].id;
		f[x]=s-ask(b[x]);
		ad(b[x],a[i].v);
		s+=a[i].v;
	}
	
	for(i=1;i<=n;++i)
		printf("%lld\n",f[i]);
	return 0;
}