Time Limit: 4000/2000 MS (Java/Others)

Memory Limit: 262144/262144 K (Java/Others)

In the game of Defense of the Ancients, a team has n units and the other team has m towers. Each unit and towerhas some hit points (HP) and a fixed attack power (AP). The units (resp. towers) with positive HP are surviving and can attack the towers (resp. units), and the units (resp. towers) with zero HP are dead (resp. destroyed) andcannot attack anything.

The game is real-time and the time goes continuously. If a tower (resp. unit) is being attacked by k units (resp.towers) with the AP of $a_1, a_2, ... , a_k$ at the same time, then its HP will continuously decrease with the rate of $a_1 + a_2 + ... + a_k$ per second. There is no restriction on attack ranges. That is, any unit can attack any towers andvice versa.

During the whole game, the surviving units (resp. towers) will attack a selected tower (resp. unit) together untilit has been destroyed (resp. killed). That is, the surviving units (resp. towers) will focus to destroy (resp. kill) the towers (resp. units) one by one.

If all the units are killed and there is at least a surviving tower, the tower team wins. If all the towers are destroyed and there is at least a surviving unit, the unit team wins. If all the units are killed and all the towers are destroyed at the same time, the game ends in a tie.

Both teams play optimally. Your task is to predict the winner of the game.

The game is real-time and the time goes continuously. If a tower (resp. unit) is being attacked by k units (resp.towers) with the AP of $a_1, a_2, ... , a_k$ at the same time, then its HP will continuously decrease with the rate of $a_1 + a_2 + ... + a_k$ per second. There is no restriction on attack ranges. That is, any unit can attack any towers andvice versa.

During the whole game, the surviving units (resp. towers) will attack a selected tower (resp. unit) together untilit has been destroyed (resp. killed). That is, the surviving units (resp. towers) will focus to destroy (resp. kill) the towers (resp. units) one by one.

If all the units are killed and there is at least a surviving tower, the tower team wins. If all the towers are destroyed and there is at least a surviving unit, the unit team wins. If all the units are killed and all the towers are destroyed at the same time, the game ends in a tie.

Both teams play optimally. Your task is to predict the winner of the game.

The first line is the number of test cases up to 10.

For each test case, there are 5 lines. The first line contains two integers n and m (0 < n ≤ 10^5, 0 < m ≤ 10^5).

The second line contains n integers, which are the HP of the units. The third line contains n integers, which are the AP of the units. The forth line contains m integers, which are the HP of the towers. The fifth line contains m integers, which are the AP of the towers.

All the HP and AP are positive and less than 2^32.

For each test case, there are 5 lines. The first line contains two integers n and m (0 < n ≤ 10^5, 0 < m ≤ 10^5).

The second line contains n integers, which are the HP of the units. The third line contains n integers, which are the AP of the units. The forth line contains m integers, which are the HP of the towers. The fifth line contains m integers, which are the AP of the towers.

All the HP and AP are positive and less than 2^32.

提交代码