#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
using P = pair<ll,ll>;
vector<P> vpii;
int n,w;

ll dp[101][101010];

void solve(){
	for(int i =0;i<n;i++){
		auto [wi,vi] = vpii[i];
		for(int j = 0;j<=w;j++){
			dp[i+1][j] = max(dp[i+1][j],dp[i][j]);
			if(j-wi>=0)
				dp[i+1][j] = max(dp[i+1][j],dp[i][j-wi]+vi);
		}
	}
	for(int i = w-1;i>=0;i--){
		cout<<dp[n][w]-dp[n][i]+1<<'\n';
	}
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n >> w;
	vpii.resize(n);
	for(auto &[l,r]:vpii)cin>>l>>r;
	solve();
}