#include<map>
#include<set>
#include<ctime>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define ll long long
#define lb long double
#define mod 1000000007
#define inf 9000000000000000000LL
#define N 100000
using namespace std;
ll read()
{
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
bool a[N+5];
int p[N+5];
void primelist()
{
    a[0]=a[1]=1;
    for(int i=2;i<N;i++)
        if(!a[i])
        {
            p[++p[0]]=i;
            for(int j=i*2;j<N;j+=i)
                a[j]=1;
        }
}
int T,n,d;
int solve(int d,int x)
{
    for(int i=1;p[i]<=x;i++)
        if(d%p[i]==0)return p[i];
    return x;
}
int get(int x)
{
    for(int i=x-1;i>=1;i--)
        if(x%i==0)return i;
}
int solve2()
{
    int ans2=0;
    for(int i=1;i*d<n;i++)
        if(get(i*d)==d)ans2++;
    return ans2;
}
int main()
{
    primelist();
//    for(int i=1;i<=10;i++)cout<<p[i]<<' ';
    T=read();
    while(T--)
    {
        n=read();d=read();
        int t=solve(d,n/d);
        if(t*d==n)t--;
//        cout<<t<<endl;
        int ans=upper_bound(p+1,p+p[0]+1,t)-p-1;
//        cout<<solve2()<<endl;
        printf("%d\n",ans);
    }
    return 0;   
}