#include <iostream>
#include <map>

using namespace std;

int coll(int x) {
	if (x % 2) {
		return 3*x+1;
	}
	return x/2;
}

int main(int argc, char *argv[]) {

	while (1) {
		unsigned A, B;
		cin >> A;
		cin >> B;
		if (A==0 && B == 0) break;
		//int m = (A<B) ? A : B;
		std::map<unsigned long,unsigned long> va; va[A] = 0;
		std::map<unsigned long,unsigned long> vb; vb[B] = 0;
		//for (int i = 0 ; i<va.size() ; ++i) cout << va[i];
		unsigned long ia=A, ib=B, sa=1, sb=1;
		bool fa=true, fb=true;
		while ((vb.find(ia) == vb.end()  && va.find(ib) == va.end()) && (fa || fb)) {
			if (fa) {
				ia = coll(ia);
				if (va.find(ia) != va.end())
					fa = false;
				else {
					va[ia] = sa;
					++ sa;
				}
			}
			if (fb) {
				ib = coll(ib);
				if (vb.find(ib) != vb.end())
					fb = false;
				else {
					vb[ib] = sb;
					++ sb;
				}
			}
			//cout << ia << "," << ib << " " << vb[ia] << "," << va[ib] <<  endl;
		}
		unsigned long rsa, rsb, v;
 		if (sb>sa) { //va.find(ib) != va.end()) {
			v = ib;
			rsa = va[ib];
			rsb = sb - 1;
		} else {
			v = ia;
			rsb = vb[ia];
			rsa = sa - 1;
		}
		cout << A << " needs " << rsa << " steps, " << B << " needs " << rsb << " steps, they meet at " << v << endl;
	}

	return 0;
}