#include<bits/stdc++.h>
using namespace std;
#define int long long
struct node{
    int a,b,c;
};
node shu[500003];
int ji[500003];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
signed main(){
    freopen("minval.in","r",stdin);
    freopen("minval.out","w",stdout);
    int n,m;
    cin>>n>>m;
    for(int i = 1;i<=n;i++){
        cin>>shu[i].a>>shu[i].b>>shu[i].c;
        q.push({shu[i].a+shu[i].b+shu[i].c,i});
        ji[i]=1;
    }
    for(int j = 1;j<=m;j++){
        
        cout<<q.top().first<<" ";
        int t=q.top().second;
        ji[t]++;
        q.push({shu[t].a*ji[t]*ji[t]+shu[t].b*ji[t]+shu[t].c,t});
        q.pop();
    }
    return 0;
}