import java.util.Scanner;

import java.util.HashMap;

public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        int i,j,MaxCount=-1;

        HashMap<Integer,Integer> map = new HashMap();

        Integer count = 1;

        int a,b;

        //循环接收数据

        while(sc.hasNext()){

            i = sc.nextInt();

            j = sc.nextInt();

            a = i;

            b = j;

            //判断两数的大小

            if (a > b) {

                a = j;

                b = i;

            }

            //循环求出i和j之间的数换算到1的循环节长度，求最大循环节长度

            for (int k = a ; k <= b; k++) {

                count = map.get(k);

                if(count==null){

                    count = f(k);

                    map.put(k, count);

                }

                MaxCount = Math.max(count, MaxCount);

            }

            System.out.println(i+" "+j+" "+MaxCount);

            MaxCount = -1;

        }

    }

    //计算循环节长度

    static int f(long k) {

        int count = 1;

        while (k != 1) {

            if ((k & 1) == 0) {

                k /= 2;

            } else {

                k = k * 3 + 1;

            }

            count++;

        }

        return count;

    }

}