#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N,W; cin >> N >> W;
  vector<vector<int>> dp(N+1,vector<int>(W+1,-(1<<30)));
  dp[0][0] = 0;
  rep(i,N){
    int w; int v; cin >> w >> v;
    rep(j,W+1){
      if(dp[i][j]<0) continue;
      chmax(dp[i+1][j],dp[i][j]);
      if(j+w<=W) chmax(dp[i+1][j+w],dp[i][j]+v);
    }
  }
  rep(i,W) chmax(dp[N][i+1],dp[N][i]);
  rep(i,W) cout << dp[N][W]+1-dp[N][W-1-i] << endl;
  return 0;
}