#include #include using namespace std; namespace my{ #define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__) #define RDVV(T,n,...) vec__VA_ARGS__;resizes({n},__VA_ARGS__);vin(__VA_ARGS__) #define VV(n,...) RDVV(ll,n,__VA_ARGS__) #define FO(n) for(ll ij=n;ij-->0;) #define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i{}) #define base_operator(op,type) auto operator op(const type&v)const{auto copy=*this;return copy op##=v;} #define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{ void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<using pack_back_t=tuple_element_t>; templateconcept vectorial=is_base_of_v::value_type>,remove_cvref_t>; templateconstexpr int rank(){if constexpr(vectorial)return rank()+1;else return 0;} templatestruct core_t_helper{using core_t=T;}; templatestruct core_t_helper{using core_t=typename core_t_helper::core_t;}; templateusing core_t=core_t_helper::core_t; templateistream&operator>>(istream&i,vector&v){fe(v,e)i>>e;return i;} templateostream&operator<<(ostream&o,const vector&v){fe(v,e)o<?newline:space);return o;} templatestruct vec; templatestruct tensor_helper{using type=vec::type>;}; templatestruct tensor_helper<0,T>{using type=T;}; templateusing tensor=typename tensor_helper::type; templatestruct vec:vector{ static constexpr int R=rank>(); using C=core_t; using vector::vector; vec(const vector&v){vector::operator=(v);} vec(const auto&...a)requires(sizeof...(a)>=3){resizes(a...);} void resizes(const auto&...a){*this=make(a...);} static auto make(ll n,const auto&...a){if constexpr(sizeof...(a)==1)return vec(n,array{a...}[0]);else return vec(n,make(a...));} vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;} vec&operator+=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]+=u[i];return v;} vec&operator-=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]-=u[i];return v;} base_operator(^,vec) base_operator(+,vec) base_operator(-,vec) vec&operator++(){fe(*this,e)++e;return*this;} vec&operator--(){fe(*this,e)--e;return*this;} ll size()const{return vector::size();} inline ll w()const requires(R==2){return (*this)[0].size();} }; templaterequires(sizeof...(A)>=2)vec(const A&...a)->vec>>; vec(ll)->vec; templatevoid resizes(const array::R+1>&s,A&...a){(apply([&](const auto&...b){a.resizes(b...); },s),...);} void lin(auto&...a){(cin>>...>>a);} void vin(auto&...a){fo(i,(a.size()&...))(cin>>...>>a[i]);} void pp(const auto&...a){ll n=sizeof...(a);((cout<0,space)),...);cout<auto binary_knapsack_maximize_value_table(const vec&w,const vec&v,T W){ vec dp(w.size()+1,W+1,T{}); fo(i,w.size()){ fo(j,W+1){ amax(dp[i+1][j],dp[i][j]); if(j+w[i]<=W)amax(dp[i+1][j+w[i]],dp[i][j]+v[i]); } } return dp; } single_testcase void solve(){ LL(N,W); VV(N,w,v); vec dp=binary_knapsack_maximize_value_table(w,v,W); fo(i,1,W+1)pp(dp[N][W]-dp[N][W-i]+1); }}