11678 - Firework Show   

Description

Writer : jjjjj19980806

Description : pclightyear

Kim Jong-un is the Chairman of the Workers' Party of Korea and supreme leader of North Korea. Recently, a group of firework makers are designing a fascinating firework show for the upcoming Day of the Sun. The makers create a total of n fireworks, each with a “beauty grade” ai. Fireworks with the same beauty grade are actually the same. Kim hopes the total beauty grade of the show to be exactly m (Do not disappoint him!). The makers wonder how many different kinds of shows meet the supreme leader’s demanding request.

Note : It is not necessary to use all n firework in a single show.

Input

The first line contains an integer T, representing the number of testcases.

Each testcase contains two lines :

The first line contains two integer n, m, representing the number of fireworks and the supreme leader's request.

The second line contains n integer ai, representing the beauty grade of each firework.

It is guaranteed that :

  • 1 ≤ T ≤ 10
  • 1 ≤ n ≤ 20
  • 1 ≤ m ≤ 50000
  • 1 ≤ ai ≤ 2000

Output

For each testcase, please output a line contains one integer represents the number of different kinds of shows that meet the supreme leader’s demanding request.

Sample Input  Download

Sample Output  Download

Tags




Discuss