PROGRAMMING:Chenyang brother lol's push tower
In the very popular lol game, if we want to win, we have to push the tower. Pushing the tower will bring economic benefits and experience benefits to the whole team, so in many cases we have to try our best to push down a tower.
Now suppose we are under the enemy tower, we know our current health X and attack power K. there are n (n < = 20) friendly soldiers under the enemy tower, each soldier's health is x [i], attack power is k [i], and there are no enemy soldiers. The health value of the defense tower is a and attack power is B. We all know that even if the soldiers have only a little blood left, they will consume an attack of the defense tower. Suppose the soldiers, heroes, The attack speed of the defense tower is equal, and the defense tower has priority to attack the first round. For the convenience of calculation, it is assumed that the defense tower will attack the soldiers in the order of (x [1] ~ x [n]).
Your task is to decide whether to push the tower down.
###Input format:
In the first line, enter the number of test groups t first, indicating that there are t groups of test data.
In the second line, enter the hero's health value x and attack power K.
In the third line, enter the number of minions n, and then enter the health x [i] and attack power K [i] of the I minion in each line.
Finally, input the health and attack power of the defense tower.
###Output format:
If you push down the defense tower before we die, output yes, otherwise output No.
###Input example:
Here is a set of inputs. For example:
```in
three
1000 50
three
10 10
10 10
10 10
500 20
100 50
two
10 10
10 10
500 10
2000 100
five
100 30
200 50
100 30
50 80
50 80
3000 200
```
###Output example:
The corresponding output is given here. For example:
```out
YES
YES
NO
```
answer：If there is no answer, please comment
Now suppose we are under the enemy tower, we know our current health X and attack power K. there are n (n < = 20) friendly soldiers under the enemy tower, each soldier's health is x [i], attack power is k [i], and there are no enemy soldiers. The health value of the defense tower is a and attack power is B. We all know that even if the soldiers have only a little blood left, they will consume an attack of the defense tower. Suppose the soldiers, heroes, The attack speed of the defense tower is equal, and the defense tower has priority to attack the first round. For the convenience of calculation, it is assumed that the defense tower will attack the soldiers in the order of (x [1] ~ x [n]).
Your task is to decide whether to push the tower down.
###Input format:
In the first line, enter the number of test groups t first, indicating that there are t groups of test data.
In the second line, enter the hero's health value x and attack power K.
In the third line, enter the number of minions n, and then enter the health x [i] and attack power K [i] of the I minion in each line.
Finally, input the health and attack power of the defense tower.
###Output format:
If you push down the defense tower before we die, output yes, otherwise output No.
###Input example:
Here is a set of inputs. For example:
```in
three
1000 50
three
10 10
10 10
10 10
500 20
100 50
two
10 10
10 10
500 10
2000 100
five
100 30
200 50
100 30
50 80
50 80
3000 200
```
###Output example:
The corresponding output is given here. For example:
```out
YES
YES
NO
```
answer：If there is no answer, please comment