#include<cstdio>
#include<queue>
#define int long long
using namespace std;
int n,m,a[500005],b[500005],c[500005];
int f(int i,int x){
    return a[i]*x*x+b[i]*x+c[i];
}
priority_queue<int>q;
void print(int x){
    if(q.size()==1){
        printf("%lld ",x);
        return;
    }
    q.pop();
    print(q.top());
    printf("%lld ",x);
}
signed main(){
    freopen("minval.in","r",stdin);
    freopen("minval.out","w",stdout);
    scanf("%lld%lld",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%lld%lld%lld",&a[i],&b[i],&c[i]);
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(q.size()<m){
                q.push(f(i,j));
            }
            else{
                if(f(i,j)<q.top()){
                    q.pop();
                    q.push(f(i,j));
                }
                else break;
            }
        }
    }
    print(q.top());
    return 0;
}