#include <fstream>

using namespace std;

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

const int DIM=1000000;
const int DIM_MATRIX=380000;

int    v[DIM+1]={0};
int    ma[8][DIM+1];
int    t,n,k;

int main()
{
    //int left,right,mid,sol;
    v[1]=0;

    for(int i=2; i<=DIM; i++)
    {
        if(v[i]==0)
        {
            for(int j=i; j<=DIM; j+=i)
            {
                v[j]++;
            }
        }

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

    }

//    for(int i = 1;i <=7 ; i++)
//    {
//        for(int j = 2; j  < 100 ; j++)
//        {
//            cout << " ( " << j << " ) "<<ma[i][j] << " ";
//        }
//        cout << endl;
//    }


    cin >>t;
    int d,left,right,mid,sol;
    for(int i=1; i<=t; i++)
    {
        cin >>n>>d;
        cout << ma[d][n]<< endl;
        continue;
        left = 1;
        right = n;
        sol = 0;
        while(left <= right)
        {
            mid = (left+ right)/2;
            if(ma[d][mid]<=n && ma[d][mid] > 0 )
            {
                sol =  ma[d][mid];
                left =  mid + 1;
            }
            else
                right = mid-1;
        }
        /*
        left = 1;
        right =  ma[k][0]-1;/// nr divizori primi
        sol=0;
        while(left<=right)
        {
            mid = (left+ right)/2;
            if(ma[k][mid]==n)
            {
                sol =  ma[k][mid];
                break;
            }
            else if(ma[k][mid]<n)
            {
                sol = ma[k][mid];
                left = mid+1;
            }
            else
                right = mid -1;
        }
        */
        cout <<sol<<endl;

    }
    return 0;
}