program divisors;
const
fin='divisors.in';fout='divisors.out';
var
n,m,i,j,y,max,t1,t2,tmp:longint;
a:array[0..50000000] of integer;
f1,f2:text;

begin
assign(f1,fin);reset(f1);
readln(f1,n,m);
close(f1);
y:=round(sqrt(m));

for i:=2 to y do
begin
t1:=n div i;
t2:=m div i;
if t1<i then t1:=i;
for j:=t1 to t2 do
if i<>j then inc(a[i*j],2)
else inc(a[i*j],1);
end;

for i:=n to m do
if a[i]>max then begin max:=a[i];tmp:=i;end;

assign(f2,fout);rewrite(f2);
writeln(f2,'Between ',n,' and ',m,',',tmp,' has a maximum of ',max+2,' divisors.');

close(f2);
end.