#include<stdio.h>

 int fib(int n);

 void PrintFN(int m, int n);

 int main(void)

 {

     int m, n, t;

     scanf_s("%d %d %d", &m, &n, &t);

     printf("fib(%d) = %d\n", t, fib(t));

     PrintFN(m, n);

     return ;

 }

 int fib(int n)

 {

     int a, b, t;

     a = ;

     b = ;

     /*

         斐波拉契数列

     */

     for (int i = ; i <= n; i++)

     {

         t = a + b;

         a = b;

         b = t;

     }

     return b;

 }

 void PrintFN(int m, int n)

 {

     int i = ;

     int count = ;            //对符合条件的斐波拉契数进行统计

     while (fib(i) <= n)

     {

         if (fib(i) >= m)

         {

             count++;

             if (count == )

             {

                 printf("%d", fib(i));

             }

             else

             {

                 printf(" %d", fib(i));

             }

         }

         i++;

     }

     if (count == )

     {

         printf("No Fibonacci number\n");

     }

 }