#include <cstdio>
#include <map>
using namespace std;

map<int,int> A;

int main()
{
while(1) {
	A.clear();
	int puvA, puvB;
	int step=0;
	int cisloA, cisloB; scanf("%d %d", &cisloA, &cisloB); puvA=cisloA; puvB=cisloB;
	if(cisloA==0 && cisloB==0) break;
	if(cisloA==cisloB) {
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", puvA, 0, puvB, 0, puvA);
			goto dalsi;
		}
	A[cisloA]=0;
	A[cisloB]=0;
	
	while(cisloA>1 || cisloB>1) {
		step++;
	if(cisloA>1){	if(cisloA%2==0) cisloA=cisloA/2;
		else cisloA=3*cisloA+1;
		if(A.find(cisloA)!=A.end()) {printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", puvA, step, puvB, A[cisloA], cisloA);
			goto dalsi;}
		else A[cisloA]=step;		
		}
	if(cisloB>1){	if(cisloB%2==0) cisloB=cisloB/2;
		else cisloB=3*cisloB+1;
		if(A.find(cisloB)!=A.end()) {printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", puvA, A[cisloB], puvB, step, cisloB);
			goto dalsi;}
		else A[cisloB]=step;
}
		
		
		
	}
/*	while(cisloA>1 || cisloB>1) {
		if(cisloA%2==0) cisloA=cisloA/2;
		else cisloA=3*cisloA+1;
		if(cisloB%2==0) cisloB=cisloB/2;
		else cisloB=3*cisloB+1;
		step++;
	}*/

/*	step=0;
	while(1) {
		if(A.find(cisloB)!=A.end()) {
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", puvA, A[cisloB], puvB, step, cisloB);
			goto dalsi;
		}
		if(cisloB%2==0) cisloB=cisloB/2;
		else cisloB=3*cisloB+1;
		step++;
	}*/
	dalsi: ;
}

	return 0;
}