C

#include<bitset>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#define inf 0x3f3f3f3f
#define mem(a,x) memset(a,x,sizeof(a))

using namespace std;
typedef long long ll;

//输入挂
inline ll in()
{
    ll res=0;char c;
    while((c=getchar())<'0' || c>'9');
    while(c>='0' && c<='9')res=res*10+c-'0',c=getchar();
    return res;
}

const int N=1000010;
ll prime[79000];
int p;
bitset<N> vis;

void init()
{
    for(int i=2;i<N;i++)
    {
        if(!vis[i])
        {
            prime[p++]=i;
            for(int j=i+i;j<N;j+=i)
            {
                vis[j]=1;
            }
        }
    }
}
int main()
{
    int T = in();
    int ii = 1;
    init();
    while(T--)
    {
        ll area = in(),min_side = in();
        if(min_side >= sqrt(area)){
            printf("Case %d: %d
",ii++,0);
            continue;
        }
        ll tmp = area;
        int ans = 1;
        for(int i = 0;i < p && prime[i]*prime[i] <= area;i++)
        {
            int cnt = 0;
            while(area%prime[i] == 0)
            {
                area /= prime[i];
                cnt++;
            }
            ans *= (cnt+1);
        }
        if(area != 1) ans <<= 1;
        ans >>= 1;  //因数的个数除以二就是组数，同时排除了平方根
        for(int i = 1;i < min_side;i++) 
            if(tmp%i == 0) ans--; //min_side此时是小于sqrt（area）的
        printf("Case %d: %d
",ii++,ans);
    }
    return 0;
}