1
#include <bits/stdc++.h>
2
#define endl '\n'
3
using namespace std;
4
typedef long long ll;
5

6
struct node {
7
    ll w;
8
    ll a, b, c;
9
    ll cntx = 1;
10
};
11

12
struct cmp {
13
    bool operator()(const node &a, const node &b) const {
14
        return a.w > b.w;
15
    }
16
};
17

18
int main() {
19
    ll n, m;
20
    cin >> n >> m;
21
    priority_queue<node, vector<node>, cmp> pq;
22
    for (ll i = 0; i < n; i++) {
23
        ll a, b, c;
24
        cin >> a >> b >> c;
25
        node po;
26
        po.a = a, po.b = b, po.c = c;
27
        po.cntx = 1;
28
        po.w = a + b + c;
29
        pq.push(po);
30
    }
31
    while (m--) {
32
        auto f = pq.top();
33
        pq.pop();
34
        cout << f.w << " ";
35
        f.cntx++;
36
        f.w = f.a * f.cntx * f.cntx + f.b * f.cntx + f.c;
37
        pq.push(f);
38
    }
39
    cout<<endl;
40
    return 0;
41
}