Rahul and  Shreya are playing a game of Matrix Coloring.

The game is as follows:

A N X M Matrix ( following 1 based indexing ) is provided. Every ith row  $(1 \leq i \leq N)$ is colored black from $n_i$ to Mth column, and the rest of the positions of that row are colored white. In case all the positions of the ith row are colored white, then $n_i = M+1$.

Rahul's favourite color is blue, while that of Shreya is pink.

Now Rahul and Shreya take turns, where in his/her turn they select a particular row of the matrix and color exactly either 1, 3 or 5 of the remaining white colored positions in that row with his/her favourite color (if available).

The one who is unable to color any white positions following the rules of the game in his/her turn loses the game.

Rahul, in order to impress Shreya always allows her to take the first turn.

If both Rahul and Shreya play optimally to win the game, predict who wins the Matrix Coloring Game given the initial matrix.

Input Format:

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

The T test cases follow.

The first line of each test case contains two space separated positive integers N, M denoting the number of rows and columns respectively of the Matrix.

The next line contains N space separated positive integers, where the ith integer $n_i$ denotes the first column of the ith row which is colored black.

Output Format:

The output of each test case consists of only one line which displays either "Rahul" or "Shreya" (without the quotes) denoting the winner of the Matrix Coloring Game.

Constraints:

$1 \leq T \leq 20$

$1 \leq N \leq 10^5$

$1 \leq M \leq 10^{14}$

$1 \leq n_i \leq M+1$