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

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const int inf = 1e9;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, W; cin >> n >> W;
    auto dp = vec2d(n+1, W+1, -inf);
    dp[0][0] = 0;
    for(int i = 0; i < n; i++){
        int w, v; cin >> w >> v;
        for(int x = 0; x <= W; x++){
            chmax(dp[i+1][x], dp[i][x]);
            if(x+w <= W) chmax(dp[i+1][x+w], dp[i][x]+v);
        }
    }
    vector<int> cum_max(W+1);
    cum_max[0] = dp[n][0];
    for(int x = 1; x <= W; x++) cum_max[x] = max(dp[n][x], cum_max[x-1]);

    for(int x = 1; x <= W; x++){
        cout << cum_max[W]-cum_max[W-x]+1 << endl;
    }
}