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

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

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