#include<bits/stdc++.h>
using namespace std;
priority_queue<int ,vector<int>,greater<int> >q;//大顶堆 
int A[10010],B[10010],C[10010],sum[100010];
int hs(int x,int y){
	return y*(A[x]*y+B[x])+C[x];
}
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		scanf("%d %d %d",&A[i],&B[i],&C[i]);
	}
	for(int x=1;x<=n;x++){
		for(int i=1;i<=n;i++){
			q.push(hs(i,x));
		}
	}
	for(int i=1;i<=n;i++){
		cout<<q.top()<<" ";
		q.pop();
	}	
	
	return 0;
}