#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false); 
    
    int n,w;
    cin>>n>>w;
    vector<ll> dp(w+1,0);
    for(int i = 0;i<n;i++){
        int a,b;
        cin>>a>>b;
        vector<ll> ndp = dp;
        for(int j = 0;j<=w;j++){
            if(j+a>w) break;
            ndp[j+a] = max(ndp[j+a],dp[j]+b);
        }
        swap(ndp,dp);
    }
    for(int i = 1;i<=w;i++) dp[i] = max(dp[i],dp[i-1]);
    for(int i = 1;i<=w;i++){
        ll need = dp[w] - dp[w-i];
        need++;
        cout<<need<<endl;
    }
}