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]; dp = new long[n][m + 1][2]; for (int i = 0; i < n; i++) { counts[i][0] = sc.nextInt(); int b = sc.nextInt(); counts[i][1] = counts[i][0] - b; values[i] = sc.nextInt() * (long)b; for (long[] arr : dp[i]) { Arrays.fill(arr, -1); } } String result = IntStream.rangeClosed(1, m).mapToObj(i -> String.valueOf(dfw(n - 1, i, 0))) .collect(Collectors.joining("\n")); System.out.println(result); } static long dfw(int idx, int v, int w) { if (v < 0) { return Long.MIN_VALUE / 2; } if (idx < 0) { return 0; } if (dp[idx][v][w] < 0) { if (w == 0) { dp[idx][v][w] = Math.max(dfw(idx - 1, v, 0), dfw(idx, v - counts[idx][w], 1) + values[idx]); } else { int current = v / counts[idx][1]; dp[idx][v][w] = Math.max(dfw(idx - 1, v, 0), dfw(idx - 1, v % counts[idx][1], 0) + values[idx] * current); } } return dp[idx][v][w]; } } 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(); } } }