#include <stdio.h>
#include <string.h>
//#define N 2000000
#include <map>

using namespace std;

int col(int k){
	if(k % 2 == 0)
		return k / 2;
	else
		return 3*k+1;
}

int min(int a, int b)
{
	if(a < b) return a;
	else return b;
}

int main(){
	int A, B, a, b, ca, cb, i;
	//int D[N];
	map <int,int> D;
	//for(i=0; i<N; i++)
	//	D[i] = 0;
	do
	{
		D.clear();
		scanf("%d %d", &A, &B);
		if(A == 0 && B == 0)
			break;
		a = A;
		b = B;
		ca = cb = 0;
		while(a != 1 && b != 1 && D[a] == 0 && D[b] == 0){
			D[a] = ++ca;
			a = col(a);
			D[b] = ++cb;
			b = col(b);
		}
		if(a == 1 && b == 1){
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", A, ca, B, cb, 1);
		}
		else if(a == 1){
			while(b != 1 && D[b] == 0){
				D[b] = ++cb;
				b = col(b);
			}
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", A, D[b]-1, B, cb, b);
		}
		else if(b == 1){
			while(a != 1 && D[a] == 0){
				D[a] = ++ca;
				a = col(a);
			}
			printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", A, ca, B, D[a]-1, a);
		}else{
			printf("%d %d\n", a, b);
		}
		a = A; b = B;
		while(a != 1 && b != 1 && D[a] != 0 && D[b] != 0){
			D[a] = 0;
			a = col(a);
			D[b] = 0;
			b = col(b);
		}
		if(a == 1){
			while(b != 1 && D[b] != 0){
				D[b] = 0;
				b = col(b);
			}
		}
		if(b == 1){
			while(a != 1 && D[a] != 0){
				D[a] = 0;
				a = col(a);
			}
		}
	}while(1);
	return 0;
}