#include <cstdio>
#include <bitset>
using namespace std;
char v[1000005];
int a[8][1000005];
int main()
{
    freopen("divprim.in","r",stdin);
    freopen("divprim.out","w",stdout);
    int t , n , k , i, j;
    for(i=2;i<=1000000;i+=2)v[i]=1;
    for(i=3;i<=1000000;i+=2)
        if(!v[i])
        for(j=i;j<=1000000;j+=i)v[j]++;
    for(i=0;i<8;i++)
        for(j=1;j<=1000000;j++)
    {
        a[i][j]=a[i][j-1];
        if(v[j]==i)a[i][j]=j;
    }
    scanf("%d",&t);
    for(i=1;i<=t;i++)
    {
        scanf("%d%d",&n,&k);
        printf("%d\n",a[k][n]);
    }
    return 0;
}