篩子法，注意整數溢位的問題
//====================================================================||
// ||
// ||
// 作者 : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 510000
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n\[M<<1\];
int seize\[M<<1\];
void pre(){
Set(seize,0);
Set(n,0);
for(int i=2;i<M;i++){
if(!seize\[i\]){
for(int j=i;j<M;j+=i){
seize\[j\]+=i;
}
Int t=(Int)i\*i;
if(t<M){
for(int k=i\*i;k<M;){
for(int m=k;m<M;m+=k){
seize\[m\]+=i;
}
Int tmp=(Int)k\*(Int)i;
if(tmp>=M)break;
k=tmp;
}
}
}
}
for(int i=2;i<M;i++){
int num=1;
for(int k=i;k!=seize\[k\];k=seize\[k\]){
num++;
}
n\[i\]=num;
}
// for(int i=2;i<M;i++)debug("%d %d\\n",i,n\[i\]);
}
int a,b;
int main() {
ios\_base::sync\_with\_stdio(0);
int test;
pre();
int ff=0;
scanf("%d",&test);
while(test--){
scanf("%d%d",&a,&b);
if(a>b)swap(a,b);
int ans=0;
for(int i=a;i<=b;i++){
ans=max(ans,n\[i\]);
}
printf("案例 #%d:\\n",++ff);
printf("%d\\n",ans);
}
}