Both Xnby and Hekui like playing Chinese Chess. There are two sides: black and red in Chinese Chess. Each side take moves in turns. One day, they made a composition (Now, it's red's turn):
By the way, each side can only move the "Cannon"and the "Pawn". The cannon can move in straight lines at any distance (from one cross to another) if no other chess pieces block its way. And the pawn can only move forward, one unit per turn. (For the red, top-bottom is forward, and for the black, bottom-top).
After the discussion, they all agree that only when one side, for example, the black cannon is forced to take a horizonal move which makes the red cannon can get to the hemline of the black, then the red wins (See the following figure).
So, they make a few rules:
(See the following figure)
Xnby and Hekui want to know: which side is the winner when each of them moves in the best strategy. To make it more interesting, m,n, S1,S2,S3 are not limited by Chinese Chessboard, in other words, Chessboard of this game is large enough.
There are several test cases, each case in a single line which contains 5 integers separated by a blank: m, n,S1,S2,S3 , 0≤m,n≤1000000,1≤ S1,S2,S3 ≤1000. The input terminates when one line contains a single negative integer, which needn't to be processed.
For each test case, output the winner (Red or Black).