#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

i64 GCD(i64 a, i64 b){ return b ? GCD(b,a%b) : a; }

using Modint = atcoder::static_modint<998244353>;


int main(){
    int N, W; cin >> N >> W;
    vector<int> bestV(W+1);
    rep(i,N){
        int w, v; cin >> w >> v;
        for(int t=W; t>=w; t--) bestV[t] = max(bestV[t], bestV[t-w] + v);
    }
    for(int x=1; x<=W; x++){
        int ans = bestV[W] - bestV[W-x] + 1;
        cout << ans << '\n';
    }
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;