#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
long long getNextTerm(long long n)
{
	if(n%2 == 0) return n/2;
	else return 3*n+1;
}
 
vector<int>cache(1000000, 0);
 
int getLength(long long n)
{
	if(n >= 1000000) return getLength(getNextTerm(n))+1;
 
	if(cache[n] == 0) cache[n] = getLength(getNextTerm(n))+1;
	return cache[n];
}
 
int main()
{
	cache[1] = 1;
	for(int i = 1; i < 1000000; i++) getLength(i);
 
	int i, j; while(cin >> i >> j) {
		cout << i << ' ' << j << ' '
			<< *max_element(cache.begin()+min(i, j), cache.begin()+max(i, j))
			<< '\n';
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKbG9uZyBsb25nIGdldE5leHRUZXJtKGxvbmcgbG9uZyBuKQp7CglpZihuJTIgPT0gMCkgcmV0dXJuIG4vMjsKCWVsc2UgcmV0dXJuIDMqbisxOwp9Cgp2ZWN0b3I8aW50PmNhY2hlKDEwMDAwMDAsIDApOwoKaW50IGdldExlbmd0aChsb25nIGxvbmcgbikKewoJaWYobiA+PSAxMDAwMDAwKSByZXR1cm4gZ2V0TGVuZ3RoKGdldE5leHRUZXJtKG4pKSsxOwoJCglpZihjYWNoZVtuXSA9PSAwKSBjYWNoZVtuXSA9IGdldExlbmd0aChnZXROZXh0VGVybShuKSkrMTsKCXJldHVybiBjYWNoZVtuXTsKfQoKaW50IG1haW4oKQp7CgljYWNoZVsxXSA9IDE7Cglmb3IoaW50IGkgPSAxOyBpIDwgMTAwMDAwMDsgaSsrKSBnZXRMZW5ndGgoaSk7CgkKCWludCBpLCBqOyB3aGlsZShjaW4gPj4gaSA+PiBqKSB7CgkJY291dCA8PCBpIDw8ICcgJyA8PCBqIDw8ICcgJwoJCQk8PCAqbWF4X2VsZW1lbnQoY2FjaGUuYmVnaW4oKSttaW4oaSwgaiksIGNhY2hlLmJlZ2luKCkrbWF4KGksIGopKQoJCQk8PCAnXG4nOwoJfQoJcmV0dXJuIDA7Cn0=

MSAxMAoxMDAgMjAwCjIwMSAyMTAKOTAwIDEwMDAK

1 10
100 200
201 210
900 1000