#include <stdio.h>

int main () {
  int n = 0;
  int w = 0;
  int wi = 0;
  long long v = 0LL;
  
  int res = 0;
  
  long long dp[100001] = {};
  
  res = scanf("%d", &n);
  res = scanf("%d", &w);
  for (int i = 0; i < n; i++) {
    res = scanf("%d", &wi);
    res = scanf("%lld", &v);
    for (int j = w-wi; j >= 0; j--) {
      if (dp[j+wi] < dp[j]+v) {
        dp[j+wi] = dp[j]+v;
      }
    }
  }
  
  for (int i = 0; i < w; i++) {
    if (dp[i+1] < dp[i]) {
      dp[i+1] = dp[i];
    }
  }
  
  for (int i = w-1; i >= 0; i--) {
    printf("%lld\n", dp[w]-dp[i]+1LL);
  }
  
  return 0;
}