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

#define ARR_MAX 100000000
int arr[ARR_MAX];
int seq1[100000];
int seq2[100000];

void init() {
	int i;	
	for(i=0;i<ARR_MAX;i++) arr[i];
	for(i=0;i<100000;i++) seq1[i] = seq2[i] = 0;
}

void calc(int x){
	if (!arr[x]) {
		if (x % 2 == 0) arr[x] = x/2;
		else arr[x] = (3*x) + 1;
		calc(arr[x]);
	}
}

void printArr(int x) {
	int i;
	for (i=0; i<x; i++) printf("%d, ", arr[i]);
	printf("\n");
}

void printSeq(int x) {
	int i;
	for (i=0; i<x; i++) printf("%d, ", seq1[i]);
	printf("\n");
}


int main(int argc, char **argv)  {
	init();
	int x, y;
	scanf("%d %d", &x, &y);
	while (x || y) {
		int XIN = x, YIN = y;		
		calc(x);
		calc(y);
//		printArr(100);
		int i=0; int j=0;
		while (x != 1) {
			seq1[i++] = x;
			x = arr[x];
		}
		seq1[i++] = 1;
		while (y != 1) {
			seq2[j++] = y;
			y = arr[y];
		}
		seq2[j++] = 1;
//		printSeq(i);
		int COMM,STA, STB;
		int ist, jst, end = 0;
		for (ist = 0; ist < i && !end; ist++) {
			for (jst = 0; jst < j; jst++) {
				if (seq1[ist] == seq2[jst]) {
					COMM = seq1[ist];
					STA = ist;
					STB = jst;
					end = 1;
					break;
				}
			}
		}

		printf("%d needs %d steps, %d needs %d steps, they meet at %d\n", XIN, STA, YIN, STB, COMM);

		scanf("%d %d", &x, &y);
	}

	return 0;
}