#include <cstdio>
#include <cstdlib>
#include <algorithm>

using namespace std;

int collatz (int * &NArr, int num, int &maxLen) {
int pos=0;

while (num!=1) {
	NArr[pos++]=num;
	 if (pos==maxLen) {
	 int * tmp;
	 maxLen*=2;
	 tmp=new int [maxLen];
	  for (int i=0; i<maxLen/2; i++) {
		tmp[i]=NArr[i];
		}
	 delete NArr;
	 NArr=tmp;
	 }

	if (num%2) num= (3*num) + 1;
	else num/=2;
	}
NArr[pos++]=num;

return pos;
}

 /*void mergeSort (int * &NArr, int minPos, maxPos) {
int midPos=(minPos+maxPos)/2;

if (
mergeSort(NArr, minPos, midPos-1);




merge ()


}

void merge () {

}
*/

int binarySearch (int *NArr, int len, int num) {

int left = 0, right= len-1, mid;

while (left<right) {printf (" BEEEE ");
mid=(left+right)/2;
if (NArr[mid]==num) break;
if (num<NArr[mid]) left=mid-1;
else right=mid+1;

}

return -1;
}



int main () {
int * aNArr, * bNArr, *aRPArr, a, b, aLen, bLen, aMLen, bMLen, sPos, aPos;

scanf ("%d%d", &a, &b);

while (a!=0 && b!=0) {


aMLen=a*2;
aNArr=new int [aMLen];
bMLen=b*2;
bNArr=new int [bMLen];

aLen=collatz (aNArr, a, aMLen);
bLen=collatz (bNArr, b, bMLen);

aRPArr=new int [aLen];

for (int i=0; i<aLen; i++) aRPArr[i]=aNArr[i];

sort (&aNArr[0], &aNArr[aLen]);
/*
for (int i=0; i<aLen; i++) printf ("%d ",aNArr[i] );
printf ("\n" );
for (int i=0; i<bLen; i++) printf ("%d ",bNArr[i] );
printf ("\n" );
*/
sPos=0;
while (!binary_search(&aNArr[0],&aNArr[aLen],bNArr[sPos++]));
sPos--;

for (aPos=0; aPos<aLen; aPos++) {
if (aRPArr[aPos]== bNArr[sPos]) break;
}



printf ("%d needs %d steps, %d needs %d steps, they meet at %d\n", a, aPos,b, sPos,bNArr[sPos]);

scanf ("%d%d", &a, &b);
}




return (0);
}