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 solve the $i$\-th problem. He 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. Find the longest possible time it takes him to solve his choice of problems. ### Constraints - All values in input are integers. - $1 \le N \le 40$ - $1 \le T \le 10^9$ - $1 \le A_i \le 10^9$

Input is given from Standard Input in the following format: $N$ $T$ $A_1$ $\dots$ $A_N$

Print the answer as an integer.