SYNC13C  WHAT A COACCIDENT
Ramesh and Suresh get a box full of five stars on lottery each. Since both the boxes need not have the same number of chocolates, they decide to play a game. The winner gets to have both the boxes of chocolates. They play alternatively and Suresh starts the game.
Given the number of chocolates in both the boxes, let them be c1 and c2, the player takes either c1 or c2 number of chocolates and divide the remaining box of chocolates to two boxes (these two boxes need not have the same number of chocolates). The player who cannot make such a move loses.
Given the initial number of chocolates (c1 and c2) find the winner.Assume both the players play optimally.
Input
First line of input contains a number T (1 <= T <= 1000), the number of test cases. Then follows T lines each containing two space separated integers c1 and c2
(1 <= c1 <= c2 <= 10000).
Output
For each test case print "Ramesh
" or "Suresh
" depending on who is the winner.
Example
Input: 2 3 1 4 5 Output: Ramesh Suresh
hide comments
shubham_cs_iet:
20170105 16:58:34
just think by making cases...!!! 

iharsh234:
20160701 11:18:54
Hit and Trial got AC on 4th Trial..hehe 

dushyant_bgs:
20160621 10:48:17
Consider the test case 2,2 in which Suresh wins. 

mkfeuhrer:
20160607 23:01:11
just if else ...base cases lead to logic....easy !! AC in 1 go :) 

manas0008:
20160201 16:40:54
straight away go to the base cases in these type of questions.Don't get disheartened by seeing the comments in case if you didn't find it that easy :) 

MishThi:
20150822 22:12:44
2 lines of code in python.. Just have to hit the logic.. :D AC in one go.. 

goyal:
20150714 18:30:43
@mayank since the chocolates can be divided in unequal number of chocolates and player will choose the optimal path possible so in case 2: 4,5


Mayank:
20150517 13:19:43
There's a confusion..


Devashish Mathur:
20150131 12:47:01
One of the easiest ones I solved on spoj... 

Rishabh:
20150116 12:22:49
easy one ac in one go.......test case show the ans.

Added by:  Pandian 
Date:  20131219 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 