Problem:
Score : 200 points

Problem Statement

There are N children, numbered 1, 2, ..., N.

Snuke has decided to distribute x sweets among them.
He needs to give out all the x sweets, but some of the children may get zero sweets.

For each i (1 \leq i \leq N), Child i will be happy if he/she gets exactly a_i sweets.
Snuke is trying to maximize the number of happy children by optimally distributing the sweets.
Find the maximum possible number of happy children.

Constraints

All values in input are integers.

2 \leq N \leq 100

1 \leq x \leq 10^9

1 \leq a_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N x
a_1 a_2 ... a_N

Output

Print the maximum possible number of happy children.

Sample Input 1

3 70
20 30 10

Sample Output 1

2

One optimal way to distribute sweets is (20, 30, 20).

Sample Input 2

3 10
20 30 10

Sample Output 2

1

The optimal way to distribute sweets is (0, 0, 10).

Sample Input 3

4 1111
1 10 100 1000

Sample Output 3

4

The optimal way to distribute sweets is (1, 10, 100, 1000).

Sample Input 4

2 10
20 20

Sample Output 4

0

No children will be happy, no matter how the sweets are distributed.

Solution in Ruby (2.3.3) (judge verdict: Runtime Error)

N,x=gets.split.map &:to_i
a=gets.split.map(&:to_i).sort
m=(a+[x]).inject(:gcd)
x/=m
a=a.map{|i|i/m}
dp=[[0,[]]]
1.upto(x){|i|
  #p dp
  maxc=0
  maxi=-1
  for j in 0...a.size do
    if i>=a[j] && maxc<=dp[i-a[j]][0] then
      maxc=dp[i-a[j]][0]+((dp[i-a[j]][1].include?(j)) ? 0 : 1)
      maxi=j
    end
  end
  #p maxc,maxi
  dp<<[maxc,dp[i-a[maxi]][1]+[maxi]]
}
p dp[-1][0]