Several Orz Pandas are in a line. However, God Wan is coming from left, while God Big Bread is coming from right. They're both very diaoable so Orz Pandas must hail to both of them.

The captain of Orz Pandas, CupSpirit, has invented a special 0-1 string to solve this problem. Assume S₀is an empty string, and

∀i>0 S_i= switch(S_i-1)+”1”+reverse(S_i-1)

Here “+” means concatenation of strings. reverse(x) means the result of reverting the string x, for example reverse(“100”)=”001”. And switch(x) means every '0' becomes '1' and every '1' becomes '0', for example switch(“100”)=”011”.

Now Captain CupSpirit has selected string S_Nto determine the direction of all Orz Pandas. If S_N[i]=='0', the i-th Orz Panda should hail to God Wan. Otherwise the i-th Orz Panda should hail to God Big Bread. For example, if N = 3, the Orz Pandas would be like

Please determine the direction of K-th Orz Panda.

There are multiple test cases, please process to EOF. For each test case:

The first line contains two integers N and K.

For all test cases, 1≤N≤10¹⁸, 1≤K≤min(|S_N|, 10¹⁸)。

For each test case, output one line. If this Orz Panda is hailing to God Wan, output “Orz”. Otherwise output “srO”.

S₁=”1”
S₂=”011”
S₃=”1001110”