int main(){
	int i,j,a[10000],max,k,e,d,q;
	while(scanf("%d %d",&i,&j)==2){
		d=j-i;
		q=i;
	    for(k=0;k<=d+1;k++){
			a[k]=cycle(i);
			i=i+1;
		}
		max=a[0];
		for(k=0;k<=d+1;k++){
			if(max<=a[k+1]) max=a[k+1];
		}
		printf("%d %d %d\n",q,j,max);
	}
	return 0;
}