#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;

int ciur[1000010],d[10][1000010];
int main()
{
    freopen("divprim.in", "r", stdin);
    freopen("divprim.out", "w", stdout);
    int n,k,a;
    // relizare ciur
    int p=1000000;
    for (int i=2;i<=p;i++){
        if (ciur[i]==0){
            for (int j=i;j<=p;j=j+i){
                ciur[j]++;
            }
        }
    }
    // am terminat ciurul
    // salvarea tuturor raspunsurilor poisbile
    for (int i=1;i<=7;i++){
        for (int j=1;j<=p;j++){
            if (ciur[j]==i){
                d[i][j]=j;
             }
             else {
                d[i][j]=d[i][j-1];
             }
        }
    }
    int t;
    scanf("%d", &t);
    for (int a=1;a<=t;a++){
        int n,k;
        scanf("%d%d", &n, &k);
        printf("%d\n", d[k][n]);
    }
    return 0;
}