#include <iostream>
#include <algorithm>
using namespace std;
int getLength(int n)
{
if(n == 1) return 1;
if(n%2 == 0) return getLength(n/2)+1;
else return getLength(3*n+1)+1;
}
int main()
{
int i, j; while(cin >> i >> j) {
int currMax = 0;
for(int n = min(i, j); n <= max(i, j); n++)
currMax = max(currMax, getLength(n));
cout << i << ' ' << j << ' ' << currMax << '\n';
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGdldExlbmd0aChpbnQgbikKewoJaWYobiA9PSAxKSByZXR1cm4gMTsKCWlmKG4lMiA9PSAwKSByZXR1cm4gZ2V0TGVuZ3RoKG4vMikrMTsKCWVsc2UgcmV0dXJuIGdldExlbmd0aCgzKm4rMSkrMTsKfQoKaW50IG1haW4oKQp7CglpbnQgaSwgajsgd2hpbGUoY2luID4+IGkgPj4gaikgewoJCWludCBjdXJyTWF4ID0gMDsKCQlmb3IoaW50IG4gPSBtaW4oaSwgaik7IG4gPD0gbWF4KGksIGopOyBuKyspCgkJCWN1cnJNYXggPSBtYXgoY3Vyck1heCwgZ2V0TGVuZ3RoKG4pKTsKCQljb3V0IDw8IGkgPDwgJyAnIDw8IGogPDwgJyAnIDw8IGN1cnJNYXggPDwgJ1xuJzsKCX0KCXJldHVybiAwOwp9