Chandra and his brother Surya are stuck in their homes due to Corona. Having exhausted their data usage they decide to play a simple game to pass the time.
- It is a board game that they designed consisting of linear arrangement of n+1 boxes numbered 0 to n left to right.
- There is one token(playing piece) that is initially placed at n th box.(rightmost)
- Each player alternatively take turns in making their move of the common token
- In each turn the player can move the token 1,2 or k boxes to the left
- The token must not leave the board (i.e. it is impossible to make a move such that position of token becomes negative)
- The player who can’t make a move loses.
Can you predict who will win if Chandra makes the first move ?
(Both are extremely intelligent and always play the optimum move)
Input Format
First line contains t(number of games)
Each of next t lines contain 2 integers n,k
Constraints
1 ≤ T ≤ 100
0 ≤ n ≤ 109 3 ≤ k ≤ 109
Output Format
Output “Chandra” if he wins or “Surya” otherwise in each line.
(No quotes)
Sample Input 0
4 0 3 3 3 3 4 4 4
Sample Output 0
Surya Chandra Surya Chandra