CF154D Flatland Fencing

The King of Flatland will organize a knights' tournament! The winner will get half the kingdom and the favor of the princess of legendary beauty and wisdom. The final test of the applicants' courage and strength will be a fencing tournament. The tournament is held by the following rules: the participants fight one on one, the winner (or rather, the survivor) transfers to the next round. Before the battle both participants stand at the specified points on the $ Ox $ axis with integer coordinates. Then they make moves in turn. The first participant moves first, naturally. During a move, the first participant can transfer from the point $ x $ to any integer point of the interval \[ $ x+a $ ; $ x+b $ \]. The second participant can transfer during a move to any integer point of the interval \[ $ x-b $ ; $ x-a $ \]. That is, the options for the players' moves are symmetric (note that the numbers $ a $ and $ b $ are not required to be positive, and if $ a

The first line contains four space-separated integers — $ x_{1} $ , $ x_{2} $ , $ a $ and $ b $ ( $ x_{1}≠x_{2} $ , $ a

On the first line print the outcome of the battle as "FIRST" (without the quotes), if both players play optimally and the first player wins. Print "SECOND" (without the quotes) if the second player wins and print "DRAW" (without the quotes), if nobody is able to secure the victory. If the first player wins, print on the next line the single integer $ x $ — the coordinate of the point where the first player should transfer to win. The indicated move should be valid, that is, it should meet the following condition: $ x_{1}+a

In the first sample the first player can win in one move. In the second sample the first participant must go to point $ 1 $ , where the second participant immediately goes and wins. In the third sample changing the position isn't profitable to either participant, so nobody wins.