Description

Define the level 1 string s1 = “OuQ”,
and the level k string sk = “O” + sk−1 + “u” + sk−1 + “Q”.

For example:

• s2 = “O” + s1 + “u” + s1 + “Q” = “OOuQuOuQQ”
• s3 = “OOOuQuOuQQuOOuQuOuQQQ”

Given 3 integeres k,l,r.
Please find all characters of sk[l],sk[l+1],...sk[r−1],sk[r]

Input

There’re multiple testcases in input.
Three integers k,l,r on each line.

• 1 ≤ k ≤ 50
• 0 ≤ l ≤ r < length of sk
• 1 ≤ |r−l+1| ≤ 100

Output

For each testcase, print |r−l+1| characters,sk[l],sk[l+1],...sk[r−1],sk[r], for a line.

Remember ‘\n’ on the end of each line.

Sample Input  Download

Sample Output  Download

Tags

Add Tag

Discuss