using namespace std;
int a[3002][4002];
int main()
{
int i, j, n, k, t, mod=10007;
a[1][0]=1;
for (i=2; i<=2000; i++)
{
a[i][0]=1;
if ((i*(i-1))/2<3000)
k=(i*(i-1))/2;
else
k=3000;
for (j=1; j<=k; j++)
{
a[i][j]=(a[i-1][j]+a[i][j-1])%mod;
if (j-i>=0)
a[i][j]=(a[i][j]+(-a[i-1][j-i]+mod))%mod;
}
}
scanf ("%d",&t);
for (i=1; i<=t; i++)
{
scanf ("%d %d",&n,&k);
int s=0; int z;
if ((n*(n-1))/2<3000)
z=(n*(n-1))/2;
else
z=3000;
for (j=k; j<=z; j++)
s=(s+a[n][j])%mod;
printf ("Case %d: %d\n",i,s);
}
return 0;
}