import java.util.Scanner;  
  
public class CPE100 {  
    public static int algo(int a, int num){  
        if(a == 1){  
            return ++num;  
        }  
        if(a % 2 != 0){  
            return algo(3 * a + 1,++num);  
        }else {  
           return  algo(a / 2, ++num);  
        }  
  
    }  
    public static void main(String[] args) {  
        Scanner sc = new Scanner(System.in);  
        while(sc.hasNext()){  
  
            int orgA = sc.nextInt();  
            int orgB = sc.nextInt();  
  
            int proA = orgA, proB = orgB;  
            if(proA > proB){  
                int temp = proA;  
                proA = proB;  
                proB = temp;  
            }  
            int max = -1;  
            for (int i = proA; i <= proB; i++) {  
                int res = algo(i, 0);  
                if (res > max) {  
                    max = res;  
                }  
            }  
            System.out.printf("%d %d %d\n", orgA, orgB, max);  
        }  
  
    }  
}