#include <bits/stdc++.h>
#define MX 1000005
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int prim[MX][8], pr[MX];
int main()
{
    int n,x,y;
    f>>n;
    //vector<vector<int> > prim(MX+5, vector<int>(9,0));
    //int prim[MX][9];
    for(int i=2; i<=1000000; ++i){
        if(pr[i]==0){
            for(int j=i; j<=1000000; j+=i){
                pr[j]++;
            }
        }
    }
    for(int i=2; i<=1000000; ++i){
        for(int j=1; j<8; ++j){
            if(pr[i]==j)   prim[i][j]=i;
            else prim[i][j]=prim[i-1][j];
        }
    }
    while(n--){
        f>>x>>y;
        g<<prim[x][y]<<"\n";
    }
    return 0;
}