#include <fstream>
using namespace std;
ifstream cin("divprim.in");
ofstream cout("divprim.out");
bool ciur[1505];
int prim[1000];
int div(int n){
    int d = 0;
    int cnt = 0;
    while(prim[d] * prim[d] <= n && n > 1){
        int exp = 0;
        while(!(n % prim[d])) n /= prim[d], ++exp;
        if(exp) ++cnt;
        ++d;
    }
    if(n > 1) ++cnt;
    return cnt;
}
int main()
{
    ciur[0] = ciur[1] = 1;
    prim[0] = 2;
    int k = 1;
    for(int i = 2; i <= 1500; i += 2) ciur[i] = 1;
    for(int i = 3; i <= 1500; i += 2)
        if(!ciur[i]){
            prim[k++] = i;
            for(int j = i * i; j <= 1500; j += (2 * i)) ciur[j] = 1;
        }
    int t;
    cin >> t;
    while(t--){
        int n, k;
        cin >> n >> k;
        while(div(--n) != k && n);
        cout << n << "\n";
    }
    return 0;
}