Fibonacci Strings

Fibonacci sequence of strings is defined as follows:

• $s_1="b"$,

• $s_2="a"$,

• $s_k=s_{k-1}+s_{k-2}$ for $k>2$

For example, $s_3="ab",s_4="aba",s_5="abaab"$ and so on.

Given positive integers $n,m,l$. Print the substring of $s_n$ which starts at position $m$ and have the length $l$.

Input

One line contains three space-separated positive integers $n,m$ and $l(1\le n\le 40;1\le m\le length(S_n),1\le l\le 1000)$.

Output

Print the substring of $s_n$ which starts at position $m$ and have the length $l$ (the length of the printed substring may be less if the length of the remainder of the string $s_n$, starting from position $m$, is less than $l$).

Examples