Maximum Combined Weight

You are given a set of $N$ boxes with weights $w_1, w_2, \ldots, w_N$ and a weight limit $W$. Your task is to select a subset of these boxes such that the total weight does not exceed $W$, and the combined weight is maximized. In other words, find a subset $S \subseteq \{1, 2, \ldots, N\}$ such that $$\sum_{i \in S} w_i \le W$$ and $$\sum_{i \in S} w_i$$ is as large as possible.

Input Format:
The first line contains two integers $N$ and $W$, separated by a space. The second line contains $N$ integers representing the weights of the boxes.

Output Format:
Output a single integer denoting the maximum combined weight that does not exceed $W$.

inputFormat

The input is read from standard input (stdin). It consists of two lines. The first line contains two integers $N$ and $W$, where $N$ is the number of boxes and $W$ is the weight limit for the conveyor system. The second line contains $N$ space-separated integers representing the weight of each box.

outputFormat

Print a single integer to standard output (stdout), which is the maximum combined weight that does not exceed the weight limit $W$.## sample

5 20
4 8 5 3 7

20