#include int main(void){ int n,k,w,max=0; int wei[25]; scanf("%d%d",&n,&k); for(int i=0; idp[i][j]?dp[i+1][j]:dp[i][j]; if(j+wei[i]<=k)dp[i+1][j+wei[i]]=dp[i][j]+wei[i]; } } for(int i=k; i>=0; i--){ if(dp[n][i]>max)max=dp[n][i]; } printf("%d",max); return 0; }