PROGRAMMING:JOJO Porter
Dongfang Zhanzhu and kongtiao chengtaro moved together. They used their double crazy diamond and platinum star to carry furniture together. They had n (n < = 10) pieces of furniture with the weight of w [1], w [2].... w [n], (furniture weight 0 < = w [i] < = 100), while crazy diamond and platinum star had the weight of C1 and C2 (1 < = C1, C2 < = 100). The two of them must move things together. Someone can carry zero weight once, but they must move together (so that the road won't be lonely). Can you help the invincible platinum star calculate how many times they have to move at least（ The weight of furniture can be lifted by at least one person. One person can carry more than one item. Two people can't carry one item together.
###Input format:
In the first line, enter t, then n, C1, C2. Next, enter n numbers to represent the weight of the furniture.
###Output format:
Each sample outputs "scenario # I" and a new line output P, where p is at least the number of handling times.
###Input example:
Here is a set of inputs. For example:
```in
two
6 12 13
3 9 13 3 10 11
7 77 77
7 7 77 77 7 77 7
```
###Output example:
The corresponding output is given here. For example:
```out
Scenario #1:
two
Scenario #2:
two
```
answer：If there is no answer, please comment
###Input format:
In the first line, enter t, then n, C1, C2. Next, enter n numbers to represent the weight of the furniture.
###Output format:
Each sample outputs "scenario # I" and a new line output P, where p is at least the number of handling times.
###Input example:
Here is a set of inputs. For example:
```in
two
6 12 13
3 9 13 3 10 11
7 77 77
7 7 77 77 7 77 7
```
###Output example:
The corresponding output is given here. For example:
```out
Scenario #1:
two
Scenario #2:
two
```
answer：If there is no answer, please comment