///myassIZORI PRIMI
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("divprim.in");
ofstream fout("divprim.out");

int myass[1000041];
int gai[1000041][7];

void gen()
{
    for(int i = 2; i <= 1000000; i++){
        if(myass[i] == 0){
            for(int j = i; j <= 1000000; j += i){
                myass[j]++;
            }
        }
        for(int j = 0; j < 7; j++){
            gai[i][j] = gai[i - 1][j];
        }
        gai[i][myass[i] - 1] = i;
    }
}

void solve()
{
    int t, n, k;
    fin >> t;
    for(int i = 0; i < t; i++){
        fin >> n >> k;
        fout << gai[n][k - 1] << "\n";
    }
}

int main()
{
    gen();
    solve();
    return 0;
}