#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

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));

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

    for (int i=1; i<=W; i++) dp[N][i] = max(dp[N][i], dp[N][i-1]);
    for (int X=1; X<=W; X++) cout << dp[N][W] - dp[N][W-X] + 1 << endl;

    return 0;
}