code:

#include<bits/stdc++.h>
using namespace std;
#define int long long
priority_queue<int,vector<int>,greater<int> >pq;
int n,m;
int a[11451],b[11451],c[11451];
signed main(){
    cin>>n>>m;
    int minsize=(m+n)/n;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>b[i]>>c[i];
        for(int j=1;j<=minsize;j++){
            int val=a[i]*j*j+b[i]*j+c[i];
            pq.push(val);
        }
    }
    for(int i=1;i<=m;i++){
        cout<<pq.top()<<' ';
        pq.pop();
    }
}