#include <stdio.h>

int main()
{
    int a[1000];
    int b[1000];
    int ca;
    int cb;
    int i;
    int j;
    int x[1000];
    int y[1000];
    int caj;
    int cbj;
    i=0;
    j=0;
    scanf("%d %d", &a[i], &b[i]);
    j++;
    if((a[i]<=0) || (b[i]<=0)) return 0;
    while((a[i]!=0) && (b[i]!=0))
    {
        i++;
        scanf("%d %d", &a[i], &b[i]);
        j++;
    }
    for (i=0; i<j-1; i++)
    {
        caj = 0;
        cbj = 0;
        ca = 0;
        cb = 0;
        x[ca]=a[i];
        while(x[ca]!=1)
        {
            if (x[ca]%2==0) x[ca+1]=x[ca]/2;
            else x[ca+1]=3*x[ca]+1;
            ca++;
            caj++;
        }
        y[cb]=b[i];
        while(y[cb]!=1)
        {
            if (y[cb]%2==0) y[cb+1]=y[cb]/2;
            else y[cb+1]=3*y[cb]+1;
            cb++;
            cbj++;
        }
        for(ca=0; ca<=caj; ca++)
        {
            for(cb=0; cb<=cbj; cb++)
            {
                if (x[ca]==y[cb])
                {
                    printf("%d needs %d steps,%d needs %d steps, they meet at %d\n",a[i] ,ca, b[i], cb, y[cb]);
                    break;
                }
            }
            if (x[ca]==y[cb]) break;
        }
    }
    return 0;
}