#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, weight;
  cin >> N >> weight;
  vector<ll> W(N);
  vector<ll> V(N);

  for (int i = 0; i < N; ++i) {
    cin >> W[i] >> V[i];
  }

  vector<ll> dp(weight + 1, -1);
  dp[0] = 0;
  ll max_v = 0;

  for (int i = 0; i < N; ++i) {
    ll w = W[i];
    ll v = V[i];

    for (int j = weight - w; j >= 0; --j) {
      if (dp[j] == -1) continue;

      int nw = j + w;
      dp[nw] = max(dp[nw], dp[j] + v);
      max_v = max(max_v, dp[nw]);
    }
  }

  for (int w = weight - 1; w >= 0; --w) {
    cout << max(1LL, max_v - max(0LL, dp[w]) + 1) << endl;
  }

  return 0;
}