#include using namespace std; pair pairmax(pair a,pair b){ if(b > a)swap(a,b); if(a.first > b.first){ return a; } else{ return {a.first,a.second + b.second}; } } int main(){ int inf = 2e9; int N,W; cin >> N >> W; vector v(N+1),w(N+1); for(int i = 1;i <= N;i++){ cin >> v[i] >> w[i]; } int crit = 1000; vector>> dp(N+1,vector> (2001,{0,1})); for(int i = 0;i <= N;i++){ for(int j = -1000;j < 0;j++){ dp[i][j+crit] = {-inf,0}; } } pair ans = {0,0}; dp[0][0+crit] = {0,1}; for(int i = 1;i <= N;i++){ for(int j = -1000;j <= 1000;j++){ if(-1000 <= j - w[i] && j - w[i] <= 1000){ dp[i][j + crit] = pairmax(dp[i][j + crit],{dp[i-1][j-w[i] + crit].first + v[i],dp[i-1][j-w[i] + crit].second}); if(j <= W)ans = pairmax(ans,dp[N][j+crit]); } } } for(int i = 1;i <= N;i++){ for(int j = 0;j <= 16;j++){ if(dp[i][j+crit].first == -inf)cout << "# "; else cout << dp[i][j+crit].first << " "; } cout << endl; } cout << ans.first << " " << ans.second << endl; return 0; }