#include<bits/stdc++.h>
using namespace std;
int baoli(int i){
   	int tot=0;
   	for(int j=1;j<=i;j++){
   		if(!(i%j)){
   			tot++;
   		}
	}
    return tot;
}
int main(){  
	freopen("divisors.in","r",stdin);
	freopen("divisors.out","w",stdout);
    int m,n,a=0;
    scanf("%d%d",&n,&m);
    int d=0,p=m;
    for(int i=n;i<=m;i++){
       	int k=baoli(i);
       	if(k>d){
       		d=k,p=i,a++;
		}
	}
    printf("Between %d and %d,%d has a maximum of %d divisors.\n",n,m,p,d);
    return 0;
}