#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using Graph = vector<vector<int> >;
using mint = modint998244353;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e+18;

#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define REPB(i,n) for(int i = n-1; (int)i >= 0; --i)
#define FOREACH(x,a) for(auto& (x) : (a) 
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define ALL(x) x.begin(),x.end()
#define VI vector<int>
#define VL vector<ll>
#define VS vector<string>
#define VC vector<char>
#define VVI vector<vector<int> >
#define VVL vector<vector<ll> >
#define VVC vector<vector<char> >
#define VPII vector<pair<int,int> >
#define VPLL vector<pair<ll,ll> >
#define VPSI vector<pair<string,int> >

template <class T>
    inline void printVec(std::vector<T> v){
    REP(i,v.size()){
    if(i) std::cout << " ";
    std::cout << v[i];
    } std::cout << std::endl;
}

template <class T> bool chmax(T& a,T b) {
   if(a < b) {
       a = b;
       return true;
   }
   return false;
}
template <class T> bool chmin(T& a,T b) {
   if(a > b) {
       a = b;
       return true;
   }
   return false;
}
ll gcd(ll a, ll b){
   if(a % b == 0) return b;
   else return gcd(b, a % b);
}
ll lcm(ll a, ll b){
   return a * b / gcd(a,b);
}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    int n,w;
    cin >> n >> w;

    VL W(n),V(n);

    REP(i,n){
        cin >> W[i] >> V[i];
    }

    VVL dp(n+1,VL(w+1,-1));

    REP(i,w+1) dp[0][i] = 0;
    REP(i,n+1) dp[i][0] = 0;

    REP(i,n){
        REP(j,w+1){
            if(j >= W[i]) dp[i+1][j] = max(dp[i][j - W[i]] + V[i], dp[i][j]);
            else dp[i+1][j] = dp[i][j];
        }
    }

    // REP(i,n+1){
    //     REP(j,w+1){
    //         cout << dp[i][j] << " ";
    //     }
    //     cout << endl;
    // }
    // cout << dp[n][w] << endl;

    ll ans = dp[n][w] + 1;

    REP(i,w){
        cout << ans - dp[n][w-i-1] << endl;
    }

    return 0;
}