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

using namespace std;

#define MX 2001001

int a,b;
map<long long,int> q;
//int v[MX];

void go(long long x)
{
	int k=0;
	while(x!=1)
	{
		q[x]=k;
		//if (x<MX) v[x]=k;
		++k;
		if (x&1) x=3*x+1;
		else x/=2;
	}
	//v[x]=k;
	q[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);
		q.clear();
		go(a);
		int bs=0;
		long long x=b;
		while(x!=1)
		{
			if (q.count(x)>0)//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,q[x],b,bs,(int)x);
		cout<<a<<" needs "<<q[x]<<" steps, "<<b<<" needs "<<bs<<" steps, they meet at "<<x<<endl;
	}
	return 0;
}