#include <cstdio>#include <algorithm>usingnamespacestd;
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 ) {
unsignedint n = i;
cycle_length = 1;
while ( n != 1 ) {
if ( n % 2 == 1 ) {
n = 3 * n + 1;
n >>= 1;
//or n = n >> 1;//is much faster than n = n / 2;
cycle_length += 2;
}
else {
n /= 2;
cycle_length++;
}
}
if ( cycle_length > max_cycle_length )
{
max_cycle_length = cycle_length;
}
i++;
}
printf ("%d %d %d\n", temp_i, temp_j, max_cycle_length);
}
return0;
}