Fibonacci Strings#2523
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 , , . Print the substring of s_n which starts at position and has length .
One line contains three space-separated positive integers , , and (1 \leq n \leq 40;\ 1 \leq m \leq \text{length}(s_n),\ 1 \leq l \leq 1000).
Print the substring of s_n which starts at position and has length (the length of the printed substring may be less if the length of the remaining suffix of s_n starting from position is less than ).
Example 1
Example 2