#include<bits/stdc++.h>
using namespace std;
int d[1000005],t,n,k,st,dr,sol,mid;
vector<int> v[10];
int main()
{
    freopen("divprim.in","r",stdin);
    freopen("divprim.out","w",stdout);
    d[1]=0;
    for(int i=2;i<=1000000;i++)
    {
        if(!d[i])
        {
            d[i]=1;
            for(int j=(i<<1);j<=1000000;j+=i)
            {
                d[j]++;
            }
        }
    }
    v[0].push_back(1);
    for(int i=2;i<=1000000;i++)
    {
        if(d[i]<=7)
        {
            v[d[i]].push_back(i);
        }
    }
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        scanf("%d%d",&n,&k);
        st=0;
        dr=v[k].size()-1;
        sol=-1;
        while(st<=dr)
        {
            mid=(st+dr)>>1;
            if(*(v[k].begin()+mid)<=n)
            {
                sol=mid;
                st=mid+1;
            }
                else dr=mid-1;
        }
        if(sol==-1) printf("0\n");
            else printf("%d\n",sol);
    }
    return 0;
}