#include <iostream>
#include <cstdio>
using namespace std;

int num (const int &x){
	if ((x%2) == 0){
		return (x/2);
	} else {
		return (3*x +1);
	}
}



int * makeArr(const int &x, int &len){
	int size = 10;
	int items =0;
	int * array = new int [size];

	array[0] = x;

	while (1){
		int number = num (array[items]);
		items++;

		if (size == items){
			size *=2;
			int *tmp = new int [size];

			for (int i=0; i< items; i++){
				tmp[i]=array[i];
			}

			delete [] array;
			array = tmp;
		}

		array[items] = number;

		if (number == 1){
			break;
		}
	}

	len = items;
	return array;
}

int search (int & a_index, int & b_index, int * a, int * b, int len_a, int len_b){
	for (int i=0; i < len_a; i++){
		for (int j=0; j<len_b; j++){
			if (a[i] == b[j]){
				a_index = i;
				b_index = j;
				return 1;
			}
		}
	}
	return -1;
}

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

while (1){

	int x=0;
	int y=0;
	int len_x=0;
	int len_y=0;
	
	scanf ("%d %d",&x,&y);
	if ((x==0)&&(y==0)){
		break;
	}

	if (x == y){
		printf("%d needs 0 steps, %d needs 0 steps, they meet at %d\n", x,y,x);
		continue;;
	}

	int * arr_x = makeArr(x,len_x);
	int * arr_y = makeArr(y,len_y);

	
	int a_pos=0;
	int b_pos=0;

	search (a_pos,b_pos,arr_x, arr_y,len_x,len_y);
	
	printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", x,a_pos,y,b_pos,arr_x[a_pos]);
	delete [] arr_x;
	delete [] arr_y;
}

return (0);
}