#include <stdio.h>

int main () {
  int n = 0;
  int m = 0;
  int a[5000] = {};
  int b[5000] = {};
  long long c[5000] = {};
  
  int res = 0;
  
  long long dp[5001][5000] = {};
  
  res = scanf("%d", &n);
  res = scanf("%d", &m);
  for (int i = 0; i < n; i++) {
    res = scanf("%d", a+i);
    res = scanf("%d", b+i);
    res = scanf("%lld", c+i);
  }
  
  for (int i = 0; i < m; i++) {
    long long ans = 0LL;
    for (int j = 0; j < n; j++) {
      if (i+1 >= a[j] && ans < dp[i+1-a[j]][j]+((long long)b[j])*c[j]) {
        ans = dp[i+1-a[j]][j]+((long long)b[j])*c[j];
      }
    }
    for (int j = 0; j < n; j++) {
      dp[i+1][j] = ans;
      if (i+1 >= a[j]-b[j] && dp[i+1][j] < dp[i+1-a[j]+b[j]][j]+((long long)b[j])*c[j]) {
        dp[i+1][j] = dp[i+1-a[j]+b[j]][j]+((long long)b[j])*c[j];
      }
    }
    printf("%lld\n", ans);
  }
  
  return 0;
}