#include <cstdio>
#include <cstdlib>
#include <set>
using namespace std;

struct zaz {
	int num, steps;
	zaz(int a, int b) {num=a; steps=b;}
	bool operator<(const zaz &z) const {return num<z.num;}
};

set<zaz> A, B;

int main()
{
A.clear(); B.clear();
while(1) {
	int puvA, puvB;
	int cisloA, cisloB; scanf("%d %d\n", &cisloA, &cisloB); puvA=cisloA; puvB=cisloB;
	if(cisloA==0 && cisloB==0) break;
	A.insert(zaz(cisloA, 0));
	B.insert(zaz(cisloB, 0));
	int step=0;
	while(cisloA>1 || cisloB>1) {
		if(B.find(zaz(cisloA, -1))!=B.end()) {
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", puvA, step, puvB, B.find(zaz(cisloA, -1))->steps, cisloA);
			A.clear(); B.clear();
			goto dalsi;
		}
		if(A.find(zaz(cisloB, -1))!=A.end()) {
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", puvA, A.find(zaz(cisloB, -1))->steps, puvB, step, cisloB);
			A.clear(); B.clear();
			goto dalsi;
		}
		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++;
		A.insert(zaz(cisloA, step));
		B.insert(zaz(cisloB, step));
	}
	if(B.find(zaz(cisloA, -1))!=B.end()) {
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", puvA, step, puvB, B.find(zaz(cisloA, -1))->steps, cisloA);
			A.clear(); B.clear();
			goto dalsi;
	}
	if(A.find(zaz(cisloB, -1))!=A.end()) {
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", puvA, A.find(zaz(cisloB, -1))->steps, puvB, step, cisloB);
			A.clear(); B.clear();
			goto dalsi;
	}
	dalsi: ;
}

	return 0;
}