#include<cstdio>
#include<algorithm>
#include<cstring>
#define Nmax 1005
using namespace std;
int n,k,i,j,t,pr[Nmax],p;
bool w[Nmax];
int v[8][1000002];
int cb(int k,int x)
{
    int st=1,dr=v[k][0],mij=0;
    if (x<v[k][1]) return 0;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (v[k][mij]<=x && v[k][mij+1]>x) return mij;
        if (v[k][mij]<x) st=mij+1;
        else dr=mij-1;
    }
    return 0;
}
void numereprime()
{
    int i,j;
    for (i=2;i<=Nmax-5;i++)
    if (!w[i])
    {
        pr[++pr[0]]=i;
        if (i*i>Nmax-5) continue;
        for (j=i*i;j<=Nmax-5;j+=i)
        w[j]=1;
    }
}
void desc(int x)
{
    int nr=0,i,val=x;
    for (i=1;pr[i]*pr[i]<=x;i++)
    if (x%pr[i]==0)
    {
        ++nr;
        while (x%pr[i]==0)
        x/=pr[i];
        if (x!=1 && nr==7) return;
    }
    if (x!=1) nr++;
    v[nr][++v[nr][0]]=val;
}
int main()
{
    freopen("divprim.in","r",stdin);
    freopen("divprim.out","w",stdout);
    numereprime();
    for (i=2;i<=1000000;i++)
    if (!w[i]) v[1][++v[1][0]]=i;
    else desc(i);
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d %d",&n,&k);
        p=cb(k,n);
        if (p==0)
        {printf("0\n"); continue;}
        printf("%d\n",v[k][p]);
    }
    return 0;
}