import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { static int[] counts; static long[] values; static long[][] dp; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); counts = new int[n * 2]; values = new long[n * 2]; for (int i = 0; i < n; i++) { int a = sc.nextInt(); int b = sc.nextInt(); long c = sc.nextInt(); counts[i * 2] = a - b; values[i * 2] = b * c; counts[i * 2 + 1] = a; values[i * 2 + 1] = b * c; } dp = new long[n * 2][m + 1]; for (long[] arr : dp) { Arrays.fill(arr, -1); } StringBuilder sb = new StringBuilder(); for (int i = 1; i <= m; i++) { sb.append(dfw(n * 2 - 1, i)).append("\n"); } System.out.print(sb); } static long dfw(int idx, int v) { if (v < 0) { return Long.MIN_VALUE; } if (idx < 0) { return 0; } if (dp[idx][v] < 0) { if (idx % 2 == 0) { dp[idx][v] = Math.max(dfw(idx - 1, v), dfw(idx, v - counts[idx]) + values[idx]); } else { dp[idx][v] = Math.max(dfw(idx - 2, v), dfw(idx - 1, v % counts[idx]) + values[idx] * (v / counts[idx])); } } return dp[idx][v]; } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }