#include <iostream>

 using namespace std;

 int a,b;

 long long cnt,n,ans;

 int main()

 {

     while(~scanf("%d%d",&a,&b))

     {

         ans=;

         int p=a,q=b;

         if(p>q) swap(p,q);

         for(int i=p;i<=q;i++)

         {

             cnt=;

             n=i;

             while()

             {

                 cnt++;

                 if(n==) break;

                 if(n%) n=*n+;

                 else n/=;

             }

             if(cnt>ans) ans=cnt;

         }

         printf("%d %d %ld\n",a,b,ans);

     }

 }

 //dp[i]=dp[3*i+1]+1;

 //dp[i]=dp[i/2]+1;