#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <list>

#define FOR(a,b,c) for(int a=b;a<=c;a++) 
#define SIZEOF(a) (sizeof(a)/sizeof(a[0]))
#define FORARR(i,a) for(unsigned i=0; i<SIZEOF(a);i++)
#define FOREACH(a,b) for(_typeof((b).begin()) a=(b).begin(); a!=(b).end();a++)
#define GETI(a) scanf("%d", &a)

using namespace std;

int main(void)
{
	long long m,n;
	while (scanf("%lld %lld ",&n,&m)==2 && n!=0 && m!=0) {
		// <cislo, poradi>
		map<long long, long long> first, second;
		int nasiel = 0;
		//fi, se - cisla
		long long fi,se,a,b,spolu;
		a=n; b=m;
		int i=0;
		while (!nasiel){
			//cout<< "n: "<<n<<" m: "<<m<<endl;
			if (first.find(n)==first.end()) {
				first[n] = i;
			}
			if (second.find(m)==second.end()) {
				second[m] = i;
			}
				
			if (first.find(m) != first.end()){
				nasiel=1;
				se=second[m];
				fi=first[m];
				spolu=m;
				break;
			}
			if (second.find(n) != second.end()){
				nasiel=1;
				fi=first[n];
				se=second[n];
				spolu=n;
				break;
			}
			
			if (n != 1) {
				if (n%2) n=n*3+1;
				else n/=2;
			}
			if (m != 1) {
				if (m%2) m=m*3+1;
				else m/=2;
			}
			
			i++;
		}
		printf("%lld needs %lld steps, %lld needs %lld steps, they meet at %lld\n",a,fi,b,se,spolu);
		
	
	}

	return 0;
}