It's sweet distribution day in Micro's school. He's very happy. All the students in Micro's class are sitting on chairs which are arranged in a matrix of size N×M i.e. there are N rows of chairs numbered from 1 to N and in each row there are M chairs numbered from 1 to M. Micro is sitting at coordinate (Dx,Dy) (Dthy chair of Dthx row). Teacher gives the box to a student sitting in one of the four corners: (1,1), (1,M), (N,1) or (N,M). Students have to take one sweet from the box and pass the box to the next student (student sitting to left, right, front or back). For a student sitting at coordinate (x,y), he'll follow the following priority order:
Now, Micro is curious to find out the direction in which he'll have to pass the sweet box. Since there are a lot of students in Micro's class, it will take long for the box to reach him, and you know Micro, he just can't wait. So he asks you to find out the direction in which he'll have to pass the box, or will he have to shout Over.
Input:
First line consists of a single integer, T, denoting the number of test cases. Each test case consists of three lines.
First line of each test consists of two space separated integer denoting N and M.
Second line of each test case consists of two space separated integers Sx and Sy, denoting the coordinate of the corner from which sweet distribution starts.
Third line of each test case consists of two space separated integers denoting Dx and Dy, coordinates of Micro.
Output:
For each test case, print "Left", "Right", "Front", "Back", "Over", depending on whether Micro will pass the box to student in left, right, front or back, or if he'll shout over.
Constraints:
1≤T≤105
1≤N,M≤103
1≤Dx≤N
1≤Dy≤M
Sx=1 or Sx=N
Sy=1 or Sy=M
In first test case Micro is the last student to receive sweet box, so he'll shout Over.
In second test case Micro is sitting in middle chair of second row, and there is a student in his right i.e. at (2,3) who has not received sweet, so he'll pass it right.