{"problem":{"name":"Programming Contest","description":{"content":"Takahashi will participate in a programming contest, which lasts for $T$ minutes and presents $N$ problems.   With his extrasensory perception, he already knows that it will take $A_i$ minutes to solv","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc184_f"},"statements":[{"statement_type":"Markdown","content":"Takahashi will participate in a programming contest, which lasts for $T$ minutes and presents $N$ problems.  \nWith his extrasensory perception, he already knows that it will take $A_i$ minutes to solve the $i$\\-th problem.  \nHe will choose zero or more problems to solve from the $N$ problems so that it takes him no longer than $T$ minutes in total to solve them.  \nFind the longest possible time it takes him to solve his choice of problems.\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\le N \\le 40$\n*   $1 \\le T \\le 10^9$\n*   $1 \\le A_i \\le 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $T$\n$A_1$ $\\dots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc184_f","tags":[],"sample_group":[["5 17\n2 3 5 7 11","17\n\nIf he chooses the $1$\\-st, $2$\\-nd, $3$\\-rd, and $4$\\-th problems, it takes him $2+3+5+7=17$ minutes in total to solve them, which is the longest possible time not exceeding $T=17$ minutes."],["6 100\n1 2 7 5 8 10","33\n\nIt is optimal to solve all the problems."],["6 100\n101 102 103 104 105 106","0\n\nHe cannot solve any of the problems."],["7 273599681\n6706927 91566569 89131517 71069699 75200339 98298649 92857057","273555143\n\nIf he chooses the $2$\\-nd, $3$\\-rd, and $7$\\-th problems, it takes him $273555143$ minutes in total to solve them."]],"created_at":"2026-03-03 11:01:14"}}