#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N, W;
	cin >> N >> W;
	vi v(N), w(N);
	rep(i, N) cin >> w[i] >> v[i];

	lint a=0, b=0, c=0, x, y, z;
	vvi dp(N+1, vi(W+1));
	rep(i, N) {
		rep(j, W+1) {
			chmax(dp[i+1][j], dp[i][j]);
			if (j+w[i] <= W) chmax(dp[i+1][j+w[i]], dp[i][j]+v[i]);
		}
	}
	b = dp[N][W]+1;
	rep(i, W) {
		cout << b-dp[N][W-i-1] << endl;
	}
}