#include <fstream>
#include <algorithm>
#include <cstdlib>
#define NMAX 1000010
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int m[NMAX][10],prim[NMAX],i,j,n,a,b;

int main()
{
for (i=2;i<=NMAX;++i)
{
    if (!prim[i])
        for (j=i;j+i<=NMAX;++prim[j],j+=i);
    for (j=1;j<=7;++j)
        m[i][j]=m[i-1][j];
    m[i][prim[i]]=i;
}
    f>>n;
    while (n--)
    f>>a>>b,g<<m[a][b]<<'\n';
    return 0;
}