### Last Hit

Time Limit: 1000 ms Memory Limit: 65536 KiB

#### Problem Description

Kirito likes playing LOL, but he is a noob who never wins. His teammates don't want to play with him anymore. After practicing with AI for months, he thinks it's time to return to the battlefield!

Now there are N enemy minions in front of him. He wants to give them the last hit to get more gold. The last hit means that the minion's HP is reduced to or below zero (HP ≤ 0) after this hit. The minions are attacking a defense tower now. The tower has enough HP so it will not be destroyed and Kirito will not be attacked.

Kirito can reduce a minion's HP by Y at each hit while the tower's attack value is X. The tower has the same attack speed as Kirito's, so if Kirito choose to attack at every opportunity they will take turns hitting the minions. Kirito can choose not to attack but the tower will keep attacking until all minions are killed. Besides, Kirito can choose which minion to hit but the tower will always attack the minion according to the input sequence.

As an observer of the game, you want to know how many last hits can Kirito get at most. Suppose the tower attacks first.

#### Input

The first line of input contains an integer T, indicating the number of test cases (T ≤ 100).

The first line of each test case contains three integers N, X, Y (1 ≤ N ≤ 1000, 0 ≤ X, Y ≤ 109).

Next line contains N integers representing the HP of each minion (1 ≤ HP ≤ 109).

#### Output

One line for each test case, containing the number of last hits can Kirito get.

2
3 1 1
1 2 3
3 2 1
3 2 1

2
2

#### Source

“浪潮杯”山东省第六届ACM大学生程序设计竞赛