#include <iostream>

#include <string>

#include <vector>

#include <stdio.h>

using namespace std;

#define REP(i, a, b) \

for (int i = (int) a; i <= (int)b; i++)

int cal(int n);

int cal(int n) {

int result = 1;

while(n != 1) {

if (n%2 == 1) {

n = 3*n + 1;

n >>= 1;

result +=2;

} else {

n >>=1;

result++;

}

}

return result;

}

int main ()

{

int i, j;

while ( scanf ("%d %d", &i, &j) != EOF ) {

int temp_i = i;

int temp_j = j;

if ( i > j ) swap (i, j);

int max_cycle_length = 0;

int cycle_length;

while ( i <= j ) {

unsigned int n = i;

cycle_length = cal(n);

if ( cycle_length > max_cycle_length )

max_cycle_length = cycle_length;

i++;

}

printf ("%d %d %d\n", temp_i, temp_j, max_cycle_length);

}

return 0;

}