406955: GYM102625 A Farewell or Best Wishes

To bid farewell to the final years, their juniors have planned a trip to Topchanchi.

The map of IIT(ISM) Dhanbad can be described as a $$$N*M$$$ grid. The students will be starting their journey from Amber Hostel located at cell ($$$1, 1$$$) via auto. To safely execute their plans they want to reach the main gate (cell ($$$N, M$$$)) without being spotted by Mr. Manohar's secret agents.

Mr. Manohar's office is located at cell ($$$X, Y$$$) and at time $$$t=0$$$ when the auto starts, $$$4$$$ secret agents start from the cell ($$$X$$$, $$$Y$$$) and are supposed to move in $$$4$$$ different directions. If a secret agent hits any wall of the grid, he rebounds to his previous cell and starts walking in the opposite direction. For example, if an agent moving in East direction, is at the cell ($$$1, M$$$) at time $$$t=j$$$, then after a rebound, the secret agent will be at ($$$1, M-1$$$) at $$$t=j+1$$$ and will start moving in the West direction.

At time $$$t=0$$$, $$$Agent$$$ $$$1$$$ goes $$$North$$$, if possible, otherwise $$$South$$$. $$$Agent$$$ $$$2$$$ goes South, if possible, otherwise North. $$$Agent$$$ $$$3$$$ goes East, if possible, otherwise West and similarly for $$$Agent$$$ $$$4$$$.

To pick up the female attendees, the auto has to travel via Ruby Lane (i.e. from the cell ($$$1,1$$$) to ($$$1, M$$$) along the row, then ($$$1, M$$$) to ($$$N, M$$$) along the column) . Traveling across each cell takes $$$1$$$ second time (for both auto and the secret agents).

If at any instant $$$t$$$, both the secret agent and the auto arrive at the same cell, the agent becomes suspicious and the farewell trip plans get spoiled.

Given $$$N$$$, $$$M$$$ and the location of Mr. Manohar's office ($$$X$$$, $$$Y$$$) determine if it's possible to safely reach the main gate.

The first line of the input contains a single integer $$$T$$$ ($$$1 \le T \le 1000$$$)

Each of the next $$$T$$$ lines contain four space separated integers $$$N, M, X, Y$$$ $$$(2 \le N \le 10^9$$$, $$$2 \le M \le 10^9$$$, $$$1 \le X \le N$$$, $$$1 \le Y \le M)$$$ denoting the number of rows, number of columns, $$$X$$$-coordinate of Mr. Manohar's office, $$$Y$$$-coordinate of Mr. Manohar's office respectively.

For each test case, print in a newline "Farewell" if their farewell plan will succeed or "BestWishes" if not, without quotes.

2
2 3 2 2
3 3 2 1

BestWishes
Farewell

3
100000000 3 50000 2
100000000 3 50000 1
100000000 3 50000 3

BestWishes
Farewell
BestWishes

Note 1: If the current cell is $$$(i,j)$$$ North cell: $$$(i-1, j)$$$, South cell: $$$(i+1, j)$$$, East cell: $$$(i, j+1)$$$, West cell: $$$(i, j-1)$$$ .

Note 2: Two or more agents and the auto can be in the same cell at any instant t.

Note 3: However, neither any of the agents nor the auto can stay in the same cell for more than one second.