UVa 294

#include<bits/stdc++.h>
using namespace std;

typedef unsigned long long int  ull;
typedef long long int      ll;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef vector< pii >      vpii;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scii(n,m)          scanf("%d %d",&n,&m)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define line               printf("\n")
#define spc                printf(" ")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define vout(v)            for(int w=0;w<v.size();w++){if(w) cout<<' '; cout<<v[w];}
#define clr(a,x)           memset(a,x,sizeof(a))
#define pb                 push_back
#define mp                 make_pair
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
#define fastIO()           ios_base::sync_with_stdio(false); cin.tie(NULL);
/// Constants
#define eps                1e-9
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                1000000009


int divcnt(ll n)
{
    int divs=1;
    for(ll i=2;i*i<=n;i++){
        if(n%i==0){
            int cnt=1;
            while(n%i==0){
                n/=i;
                cnt++;
            }
            divs*=cnt;
        }
    }
    if(n>1){
        divs*=2;
    }
    //pfi(divs);spc;
    return divs;
}

int main()
{
	//read();
	//write();
	//fastIO();
	int n;
	sci(n);
	for(int i=1;i<=n;i++){
		ll l,u;
		sc("%lld %lld",&l,&u);
		ll in;
		int mx = 0;
		for(ll j=l;j<=u;j++){
			int divs = divcnt(j);
			if(mx<divs){
				in = j;
				mx = divs;
			}
		}
		pf("Between %lld and %lld, %lld has a maximum of %d divisors.\n",l,u,in,mx);
	}
	return 0;
}