#include<bits/stdc++.h>
using namespace std;
int n,m;
struct type{
    int a,b,c,num;
} f[500005];
vector<int>v[500005];
priority_queue<int,vector<int>,greater<int> >d;
int main(){
    freopen("minval.in","r",stdin);
    freopen("minval.out","w",stdout);
    
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>f[i].a>>f[i].b>>f[i].c;
        for(int j=1;j<=m;j++){
            v[i].push_back(f[i].a*j*j+f[i].b*j+f[i].c);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<v[i].size();j++){
            //cout<<v[i][j]<<" ";
            d.push(v[i][j]);
        }
        //cout<<"\n";
    }
    for(int i=1;i<=m;i++){
        cout<<d.top()<<" ";
        d.pop();
    }
    return 0;
}