#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
using namespace std;
int n,m;
int a[500005],b[500005],c[500005];
long long h[500005];
long long ans;
priority_queue<long long,vector<long long>,less<long long> >q;
int main(){
    freopen("minval.in","r",stdin);
    freopen("minval.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>b[i]>>c[i];
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            ans=a[i]*j*j+b[i]*j+c[i];
            if(q.size()<m)
                q.push(ans);
            else if(q.top()>ans){
                q.pop();
                q.push(ans);
            }else if(q.top()==ans){
                q.push(ans);
            }else
                break;
        }
    }
    for(int i=m;i>=1;i--){
        h[i]=q.top();
        q.pop();
    }
    for(int i=1;i<=m;i++){
        cout<<h[i]<<' ';
    }
    return 0;
}