#include <stdio.h>
#include <stdlib.h>

int a_pole[1000001];
int a_len = 1;

int b_pole[1000001];
int b_len = 1;


int big_pole[90000000];


/*int dalsi_clen(int n)
{
	return n%2 ? 3*n+1 : n/2;
}*/

int porovnaj(int *res, int *a_index, int *b_index)
{
	/*int i = 0, j = 0;
		for(i = a_len-1;i<a_len;i++)
		{
			j=0;
			for(j;j< b_len;j++)
			{
				if(a_pole[i] == b_pole[j])
				{
					*res = a_pole[i];
					*a_index = i;
					*b_index = j;
					return 0;
				}
			}
		}*/

	if(big_pole[ a_pole[a_len-1] ] == 1)
	{
		*res = a_pole[ a_len-1 ];
		*a_index = a_len-1;

		int j=0;
		for(j;j< b_len;j++)
		{
			if( a_pole[a_len-1] == b_pole[j] )
			{
				*b_index = j;
					
			}
		}
		return 0;
	}
	
	
	
	return -1;
}

int main()
{
	while(1)
	{
		int a,b;
		scanf("%d %d", &a, &b);
		if(a == 0 && b == 0) break;


		
int pom=0;
if(a>b)
{
	pom=a;
	a=b;
	b=pom;
pom=-1;
}


		int i = 1;
		//int len = 10;
		//a_pole = (int*) malloc(len * sizeof(int));
		a_pole[0] = a;
		//b_pole = (int*) malloc(len * sizeof(int));
		b_pole[0] = b;
big_pole[b]=1; 
		for(;;i++) 
		{
			/*if(i == len) 
			{
				len = len * 2;
				//a_pole = (int*) realloc(a_pole, len * sizeof(int));
				//b_pole = (int*) realloc(b_pole, len * sizeof(int));	
			}*/
			//if(!(i%5))
			//{
				int res, ia, ib;
				if(!porovnaj(&res, &ia, &ib))
				{
					//int j = 0;
					//for(j; j<a_len;j++) printf("%d ", a_pole[j]);
					//j=0;
					//printf("\n");
					//for(j; j<b_len;j++) printf("%d ", b_pole[j]);
					//printf("\n");
if(pom != -1){										
printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", a, ia, b, ib, res);
} else {
printf("%d needs %d steps, %d needs %d steps, they meet at %d\n",  b, ib,a, ia, res);
}

					break;
				}
			//}
			a_pole[a_len++] = a_pole[i-1]%2 ? 3*a_pole[i-1]+1 : a_pole[i-1]/2;//dalsi_clen(a_pole[i-1]);
			b_pole[b_len++] = b_pole[i-1]%2 ? 3*b_pole[i-1]+1 : b_pole[i-1]/2;//dalsi_clen(b_pole[i-1]);
			

			big_pole[ b_pole[b_len-2] ] = 1;


		}
		//free(a_pole);
		//free(b_pole);
		a_len = 1;
		b_len = 1;
	}
	return 0;
}