Choose some numbers from n numbers to make the sum of chosen numbers equals to m. How many ways to choose?

The same number are considered to be different.

For example, we have 3 numbers, 1 1 2, and m is equal to 3. We have 2 ways to choose.

We have multiply cases. For each case:

The first line contains two integers,

  n (1<=n<=100) — the number of numbers.

  m (1<=m<=10000) — the sum we need.

The second line contains n integers.

There should be one line per test case containing the only number, the number of ways we can choose.

3 3
1 1 2

2