Description

Koying and Thanksone are enthusiastic students who excel in programming, and are good friends. However, Thanksone likes to play tricks (捉弄) on Koying by hacking his accounts.

To avoid being hacked again, Koying decided to set up a high-strength password, ensuring that Thanksone could never hack him again.

Unfortunately, Thanksone knows Koying very well, and is also very clever. He finally discovered that Koying’s password follows the recursive function below (Koying frequently talks in his sleep and has a pet phrase (口頭禪) “OAO” ^^):

where + represents string concatenation.

Koying’s password is the substring of S_N from the L-th position to the R-th position, denoted as S_N[L : R].

Now, Thanksone provides you with Koying’s sleep-talking, along with values for N, L, and R. Please determine Koying’s password to assist Thanksone in hacking Koying’s computer.

And when you successfully help Thanksone hack Koying’s computer, Koying’s facial expression will be --> OAO.

Input

//return the k-th character of S_N, that is, S_N[k]

char find(long long int N, long long int k) {

...

}


int main() {

...

    for (long long int i = L; i <= R; i++)

        printf("%c", find(N, i));

    printf("\n");

    return 0;

}

Output

Please output a string representing S_N[L : R].

Remember to print a ‘\n’ at the end of the output.

Sample Input  Download

Sample Output  Download

Tags

Discuss