#include <stdio.h>
#define MAX 2000000
int conjecture(int x){
    int vystup= (x%2==0)?x/2:3*x+1;
    return vystup;
}
int isIn(int POLE[], int size,int x){
    if(size < MAX){
    for(int i=1; i<size;i++){
        if (POLE[i]==x)return i; 
    }
    }
    return -1;
}
void ukonci(int iterA, int iterB, int hodnota, int puvodA, int puvodB){
    iterA=iterA/2;
    iterB=iterB/2-1;
    printf("%d needs %d steps, %d needs %d steps, they meet at %d\n",puvodA, iterA, puvodB, iterB, hodnota);
}

int main(){

int A,B, it, DoA, DoB,index;
int POLE[MAX];
POLE[0]=0;


while (1){
    scanf("%d %d",&A,&B);
    if (A==0 && B==0) break;
    it = 3;
    POLE[1]=A; POLE[2]=B;
    if (A==B) {ukonci(1, 2, A,A,B);continue;}
    DoA=DoB=1;
    while (1){

        if (DoA){
            POLE[it]=conjecture(POLE[it-2]);
            index = isIn(POLE, it, POLE[it]);
            if (index!=-1) {
                if (index%2==0) {ukonci(it, index, POLE[index],A,B);break;}
                else DoA=0;
            }
        }else{POLE[it]=0;}
   //     printf("%d ",POLE[it]);
        it++;
        if (DoB){
            POLE[it]=conjecture(POLE[it-2]);
            index = isIn(POLE, it, POLE[it]);
            if (index!=-1) {
                if (index%2!=0) {ukonci(index, it, POLE[index],A,B);break;}
                else DoB=0;
                
            }
        }else{POLE[it]=0;}
    //    printf("%d ",POLE[it]);        
        it++;
    }
}


return 0;
}