Ackerman

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<20)
#define CS  (1+(u&1?dyn(u*3+1,1):dyn(u>>1,1)))
int N,M;
ll dp[MX],X,T,S;
ll dyn(ll u,bool f=0){
    if(u==1&&f)return 0;
    if(u<MX){
        ll &v(dp[u]);
        if(~v)return v;
        return v=CS;
    }
    return CS;
}
int main(void){
    CL(dp,-1);
    while(scanf("%d%d",&N,&M),N|M){
        X=-1;
        if(N>M)swap(N,M);
        FT(N,M+1)if(X<(T=dyn(k)))X=T,S=k;
        printf("Between %d and %d, %lld generates the longest sequence of %lld values.\n",N,M,S,X);
    }
    return 0;
}