Last One Standing

In a computer game, each unit is described by its health $h$, damage $d$, and time to reload $t$.

When a unit fires a missile at an opposing unit, the opponent's health decreases by $d$ 0.5 seconds after the missile is fired. The time between consecutive missile launches by the same unit must be at least $t$ seconds.

For simplicity, the missile supply is infinite for all units in the game.

Two players fight in this game. The first player controls a unit with health $h_1$, damage $d_1$, and reload time $t_1$. The second player controls a unit with health $h_2$, damage $d_2$, and reload time $t_2$. Both units are fully reloaded at the start of the fight, so they can fire missiles immediately.

A unit is destroyed when its health becomes zero or negative. A player wins if there is a moment when the opponent's unit is destroyed while their own unit is not.

A missile takes 0.5 seconds to reach its target. Both units can fire at the same time and destroy each other.

Determine who wins when both players act optimally.

One line contains the integers $h_1$, $d_1$, and $t_1$ ($1 \le h_1, d_1, t_1 \le 1000$).

The second line contains the integers $h_2$, $d_2$, and $t_2$ ($1 \le h_2, d_2, t_2 \le 1000$).

Print player one if the first player wins, player two if the second player wins, or draw if neither player wins.