PROGRAMMING:LC's game road 3
Recently, $$LC $$is addicted to a game and has fun every day. But there is a bad thing about this game, that is, when you want to buy a prop, you have to collect the money for the prop from the various denominations of gold coins you have, or you can't buy the prop. Now, $$LC $$wants to buy a new prop, but recently, $$LC $$is busy studying and has no time to calculate whether he can buy the prop, so please come and help him to calculate.
###Input format:
In the first line, enter the number of sample groups $$t (1 < = T < = 20) $$. Each group of data input two positive integers $$n (1 < = n < = 100) $$and $$m (1 < = m < = 20000) $$, which means there are now $$n $$gold coins and the price of the props you want to buy $$M $$. In the next line, enter $$n $$positive integers for the face value of each gold coin, which may be the same in the range of $$[11000] $.
###Output format:
Each group of data, if the existing gold coins can constitute the price of the props you want to buy. Then output "yes" in one line, and output the number of combinations every other space; Otherwise, only "no" (without double quotes) is output. Since the number of combinations may be large, please modulus $$10 ^ 9 + 7 $
###Input example:
```in
two
3 3
1 1 1
5 16
1 2 3 4 5
```
###Output example:
```out
YES 1
NO
```
answer：If there is no answer, please comment
###Input format:
In the first line, enter the number of sample groups $$t (1 < = T < = 20) $$. Each group of data input two positive integers $$n (1 < = n < = 100) $$and $$m (1 < = m < = 20000) $$, which means there are now $$n $$gold coins and the price of the props you want to buy $$M $$. In the next line, enter $$n $$positive integers for the face value of each gold coin, which may be the same in the range of $$[11000] $.
###Output format:
Each group of data, if the existing gold coins can constitute the price of the props you want to buy. Then output "yes" in one line, and output the number of combinations every other space; Otherwise, only "no" (without double quotes) is output. Since the number of combinations may be large, please modulus $$10 ^ 9 + 7 $
###Input example:
```in
two
3 3
1 1 1
5 16
1 2 3 4 5
```
###Output example:
```out
YES 1
NO
```
answer：If there is no answer, please comment