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

map<int,int> A;

int main()
{
while(1) {
	A.clear();
	int puvA, puvB;
	int cisloA, cisloB; scanf("%d %d", &cisloA, &cisloB); puvA=cisloA; puvB=cisloB;
	if(cisloA==0 && cisloB==0) break;
	A[cisloA]=0;
	int step=1;
	while(cisloA>1) {
		if(cisloA%2==0) cisloA=cisloA/2;
		else cisloA=3*cisloA+1;
		A[cisloA]=step;
		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;
}