You are given an array of n numbers. In how many ways can you choose a subset of the numbers with sum x?
The first line has two numbers n(1≤n≤40) and x(1≤x≤109): the array size and the required sum.
The second line has n integers t1,t2,...,tn(1≤ti≤109): the numbers in the array.
Print the number of ways you can create the sum x.