/*   @JUDGE_ID:   1705PZ   371   C */
#include <stdio.h>
#include <math.h>

long work(double x){
long count = 0;
do{
        count++;
        if(fmod(x,2) == 0)
                x /= 2;
        else
                x = 3 * x + 1;
        }while(x != 1);
return count;
}

int main(){
double i,ans,m,n,temp;
long count,count1;
while(1){
	scanf("%lf %lf",&m,&n);
	if(m == 0 && n == 0)
		break;
	if(m > n){
		temp = m;
		m = n;
		n = temp;
		}
	count = 0;
	for(i = m;i <= n;i++){
		count1 = work(i);
		if(count1 > count){
			ans = i;
			count = count1;
			}
		}
	printf("Between %.0f and %.0f, %.0f generates the longest sequence of %ld values.\n",m,n,ans,count);
	}
return 0;
}
@END_OF_SOURCE_CODE