#include <fstream>
#include <map>

using namespace std;

ifstream cin("divprim.in");
ofstream cout("divprim.out");

const int DIM=1000000;

int v[DIM+1];
int ma[7][DIM+2];
map<int,int> mp;
int t,n,k;

int main()
{
    int left,right,mid,sol;
    for(int i=0 ; i < 7;i++)
        ma[i][0]=1; /// counter of numbers

    v[1]=1;
    for(int i=2; i<=DIM; i++)
    {
        if(v[i]==0)
        {
            for(int j=i; j<=DIM; j+=i)
            {
                v[j]++;
            }
        }
        if(v[i]<=7)
            ma[v[i]-1][ma[v[i]-1][0]++]=i;
        else
            mp.insert({i,0});

    }
/*
    for(int i=0; i<=100; i++)
    {
        cout <<  ma[1][i] << " ";
    }
    cout << endl;
    for(int i=0; i<=100; i++)
    {
        cout <<  ma[2][i] << " ";
    }
    cout << endl;
    for(int i=0; i<=100; i++)
    {
        cout <<  ma[3][i] << " ";
    }
    return 0;
    */
    cin >>t;
    for(int i=1; i<=t; i++)
    {
        cin >>n>>k;
        left = 1;
        right =  min(10*n,ma[k-1][0]-1);
        sol=0;
        if(k==0)
            right=1;
        else if(mp.find(n)!= mp.end())
            right=1;
        while(left<=right)
        {
            mid = (left+ right)/2;
            if(ma[k-1][mid]==n)
            {
                sol =  ma[k-1][mid];
                break;
            }
            else if(ma[k-1][mid]<n)
            {
                sol = ma[k-1][mid];
                left = mid+1;
            }
            else
                right = mid -1;
        }
        cout <<sol<<endl;
    }
    return 0;
}