Emma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping them relocate. To move the furniture, they only have two compact cars, which complicates everything a bit. Since the furniture does not fit into the cars, Eric wants to put them on top of the cars. However, both cars only support a certain weight on their roof, so they will have to do several trips to transport everything. The schedule for the move is planed like this:*w*_{i} of each individual piece of furniture and the capacities *C*_{1} and *C*_{2} of the two cars, how many trips to the new house does the party have to make to move all the furniture? If a car has capacity *C*, the sum of the weights of all the furniture it loads for one trip can be at most *C*.

- At their old place, they will put furniture on both cars.
- Then, they will drive to their new place with the two cars and carry the furniture upstairs.
- Finally, everybody will return to their old place and the process continues until everything is moved to the new place.

The first line contains the number of scenarios. Each scenario consists of one line containing three numbers *n*, *C*_{1} and *C*_{2}. *C*_{1} and *C*_{2} are the capacities of the cars (1 ≤ *C*_{i} ≤ 100) and *n* is the number of pieces of furniture (1 ≤ *n* ≤ 10). The following line will contain *n* integers *w*_{1}, …, *w*_{n}, the weights of the furniture (1 ≤ *w*_{i} ≤ 100). It is guaranteed that each piece of furniture can be loaded by at least one of the two cars.

提交代码