Balloon (Balloon)
In the city, there was a small leader named Znayko, known for his vast knowledge of everything. One day, he proposed building a hot air balloon for a journey. Among those who took this idea seriously were his friends: Sakharin Sakharinovich Syropchik, famous for his love of soda with syrup, and the plump Ponchik. Ponchik donned his finest suit, which he valued for its numerous pockets—seventeen in total. Each pocket was filled with packages of various snacks. As they climbed into the balloon's basket, it sank to the ground, unable to lift off. Znayko allowed them to bring only a few packages, with a combined weight not exceeding W kg (shorty grams). Your task is to determine how many packages they can take, given the weight of each package.
Input
The first line of input contains two numbers: N (the number of packages in the pockets) and W (the maximum allowable weight). The second line lists the weights of the packages, separated by spaces: P[1], P[2], …, P[N](1 ≤ N, P[i] ≤ 100, 1 ≤ W ≤ 10000).
Output
Output the maximum number of packages that can be taken "on board" the balloon.
Test Comment
You can take 4 packages, for example, those numbered 1, 2, 3, and 5. The weight of 5 packages would exceed 25 kg.