n, m = map(int, input().split())

d = []
for i in range(n):
    t, a, b = map(int, input().split())
    d.append([t, i, a, b])

w = [0] * m

for i in range(n):
    best = w[0]
    bw = 0

    for j in range(1, m):
        if w[j] < best:
            best = w[j]
            bw = j

    d[i][0] = max(d[i][0], best) + d[i][2]
    w[bw] = d[i][0]

d.sort()

last = 0
answer = [0] * n
for i in range(n):
    last = max(d[i][0], last) + d[i][3]
    answer[d[i][1]] = last

for i in answer:
    print(i)