Walk Alone and Salix Leaf are playing a special chess game on an infinite chess board, the center of which locates at . There are two Kings on the chess board, the white one belongs to Walk Alone and the black one belongs to Salix Leaf. Walk Alone moves first, after which they take turns moving their Kings.

In one move, a King moves one square in any direction. Formally speaking, if the king locates at at the beginning of one's turn, then it must move to one of where . A King must move if it is able to move. Additionally, a King is forbidden to move into the nearest blocks of the other King, or the other King may capture it during the next move.

Walk Alone wants to keep moving right, which means if Walk Alone moves to for some integer , he wins. Conversely, Salix Leaf wants to stop him, which means if it is impossible for Walk Alone to move to the place he wants, Salix Leaf wins.

Now the initial coordinates of the two Kings are given, and you should decide who will win if both of them play optimally. If Walk Alone will win, print `Walk Alone'; otherwise, print `Salix Leaf' (without quotes).

The input contains multiple test cases.

The first line of the input contains an integer , the number of test cases.

Each test case contains only one line with four integers . The coordinates of Walk Alone's and Salix Leaf's Kings are  and , respectively. It is guaranteed that .

The absolute value of all coordinates are less or equal to .

For each test case, output the winner in one line.

3
0 -1 2 1
-2 3 2 3
2 0 -1 0

Walk Alone
Salix Leaf
Walk Alone