3008. Coins (I)

输入格式

Input starts with an integer $T$ ($T\le 20$), denoting the number of test cases.

Each case starts with a line containing two integers $n$ ($1\le n\le 100$) and $K$ ($1\le K\le 100000$). The next line contains $n$ integers, denoting $A_1,A_2,\dots ,A_n$ ($1\le A_i\le 100000$). All $A_i$ will be distinct.

输出格式

For each case, print the case number and the number of ways $K$ can be made. Result can be large, so, print the result modulo $100000007$.

2
3 5
1 2 5
4 20
1 2 3 4

Case 1: 4
Case 2: 108