#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int main() {
  int N, W; cin >> N >> W;
  vector<int> w(N), v(N);
  for (int i = 0; i < N; i++) cin >> w[i] >> v[i];
  vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
  for (int i = 0; i < N; i++) {
    for (int j = 0; j <= W; j++) {
      dp[i + 1][j] = dp[i][j];
      if (j - w[i] >= 0) dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - w[i]] + v[i]); 
    }
  }
  for (int i = 1; i <= W; i++) {
    cout << dp[N][W] - dp[N][W - i] + 1 << endl;
  }
  return 0;
}