#include <stdio.h>
#include <iostream>
#include <map>

using namespace std;



int main()
{
map<int,int> amap;
map<int,int> bmap;	
int a,b;
int na=-1,nb=-1,sa=-1,sb=-1;
int cis=-1;
while(true)
{
	amap.clear();
	bmap.clear();
	a=-1;
	b=-1;
	na=-1;
	nb=-1;
	sa=-1;
	sb=-1;
	cis=-1;
	scanf("%d%d",&a,&b);
	if(a==0&&b==0)break;
	na=a;
	nb=b;
	int aindex=0,bindex=0;
	while(true)
	{	
		//cout<<"while true begin"<<endl;
		if(a!=-1)
		{
		//cout<<"insert a: "<<a<<endl;
			amap.insert(make_pair(a,aindex++));
		if(a==1)a=-1;
			if(a%2==0)
			{
				a=a/2;
			}	
			else
			{
				a=a*3+1;
			}
		}
		if(b!=-1)
		{
			//cout<<"insert b: "<<b<<endl;
			bmap.insert(make_pair(b,bindex++));
		}
        if(b==1)b=-1;
		map<int,int>::iterator itera= amap.find(b);
		map<int,int>::iterator iterb= bmap.find(a);
		if( itera != amap.end() ) {
			//cout <<"b is in amap"<<endl;
			sa=itera->second;
	  		//cout<<"aindex "<<iter->second<<endl;
			sb=bindex-1;
			cis=b;
			break;
		}
		if( iterb != bmap.end() ) {
			//cout <<"a is in bmap"<<endl;
			sb=iterb->second;
	  		//cout<<"aindex "<<iter->second<<endl;
			iterb=amap.find(a);
			//cout<<"a j"<<a<<endl;
			cis=a;			
			sa=aindex;
			break;
		}
		if(b!=-1)
		{		
			if(b%2==0)
			{
				b=b/2;
			}	
			else
			{
				b=b*3+1;
			}
		}
//		sleep(1);
	}
	/*
	map<int,int>::iterator iter;
  for( iter = amap.begin(); iter != amap.end(); ++iter ) {
    cout << "Key: '" << iter->first << "', Value: " << iter->second << endl; 
  }
	cout <<endl;
  for( iter = bmap.begin(); iter != bmap.end(); ++iter ) {
    cout << "Key: '" << iter->first << "', Value: " << iter->second << endl; 
  }
	*/
cout << na << " needs " << sa<< " steps, "<< nb << " needs " << sb <<" steps, they meet at "<<cis<<endl;
}
return 0;
}