#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } void dijkstra(vvpll &graph, ll v, vl &dist, vl &cnt){ priority_queue> pque; vector decided(graph.size()); pque.push(pll(0, v)); cnt[v] = 1; dist[v] = 0; while(pque.size()){ pll p = pque.top(); pque.pop(); if (dist[p.second] < p.first){ continue; } decided[p.second] = true; for (auto x: graph[p.second]){ if (dist[x.first] + x.second == dist[p.second] && decided[x.first]){ cnt[p.second] = (cnt[p.second] + cnt[x.first]) % mod1; } } for (auto x: graph[p.second]){ if (dist[x.first] > dist[p.second] + x.second){ dist[x.first] = dist[p.second] + x.second; pque.push(pll(dist[x.first], x.first)); } } } } int main(){ ll N, W; cin >> N >> W; vl w(N); vl v(N); rep(i,N){ cin >> w[i] >> v[i]; } ll INF = 10000000000; vvl dp(N + 1, vl(W + 1, -INF)); dp[0][0] = 0; for (ll i = 0; i < N; i++){ for (ll j = 0; j <= W; j++){ if (j + w[i] <= W){ dp[i + 1][j + w[i]] = max(dp[i + 1][j + w[i]], dp[i][j] + v[i]); } dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]); } } //debug(dp); for (ll i = 1; i <= W; i++){ if (dp[N][W] == -INF) cout << 1 << endl; else cout << dp[N][W] - dp[N][W - i] + 1 << endl; } }