#include<cstdio>
#include<string.h>

using namespace std;

#define MX 2001001

int a,b;
int v[MX];

void go(long long x)
{
	int k=0;
	while(x!=1)
	{
		if (x<MX) v[x]=k;
		++k;
		if (x&1) x=3*x+1;
		else x/=2;
	}
	v[x]=k;
}

int main()
{
	/*
	for(int i=1;i<MX;++i)
	{
		memset(v,-1,sizeof v);
		go(i);
	}
	*/
	while(scanf("%d%d",&a,&b),a+b)
	{
		memset(v,-1,sizeof v);
		go(a);
		if (b==1)
		{
			printf("%d needs %d steps, %d needs 0 steps, they meet at 1\n",a,v[1],b);
			continue;
		}
		int bs=0;
		long long x=b;
		while(x!=1)
		{
			if (x<MX&&v[x]!=-1)
			{
				break;
			}
			++bs;
			if (x&1) x=3*x+1;
			else x/=2;
		}
		printf("%d needs %d steps, %d needs %d steps, they meet at %d\n",a,v[x],b,bs,(int)x);
	}
	return 0;
}