import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
2 5
4 3 3
5 2 8
1 2
2 1 1000000000
3 10
9 8 1
5 1 8
5 2 4
"""

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,M=map(int, input().split())
  J=[list(map(int, input().split())) for _ in range(N)]
  for i in range(M):
    ans=0
    for j in range(N):
      a,b,c=J[j]
      ans=max(ans, ((i+1-a)//(a-b)+1)*b*c)
    print(ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)