PROGRAMMING:Change***

At present, the cashier has $$n $, with the face value of $$v_ 1, v_ 2, ..., v_ N $$. If the change amount is $$M $$, how many change methods are there?
Note: $$0-lt n-leq 1000 $$, $$0-lt V_ 1, v_ 2, ..., v_ n \leq 10000$$，$$0 \lt m \leq 10000$$
####Input format
> $$n$$
> $$v_ 1, v_ 2, ..., v_ n$$
> $$m$$
####Output format
>If there is a solution, then output all zero finding schemes, each output one
>If there is no solution, output "None"
####Input sample 1
```in
six
3 1 4 3 2 7
nine
```
####Output sample 1
```out
3 1 3 2
3 4 2
4 3 2
2 7
```
####Input sample 2
```in
five
5 3 4 6 7
two
```
####Output sample 2
```out
None
```







answer：If there is no answer, please comment