def fibonacci(n):
    if n in (1, 2):
        return 1
    return fibonacci(n - 1) + fibonacci(n - 2)
def seq(n,m):
    arr = []
    for i in range(n,m+1):
        arr.append(fibonacci(i))
    return arr
n, m = [int(i) for i in input().split()]
print(seq(n,m))