#include <cstdio>
#include <ctype.h>

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
}fin("divprim.in");
const int MAX_E = 1000000;
int ciur[1+MAX_E];
int vect[8][1+MAX_E];
int top[8];

int bins(int st, int dr, int k, int n) {
  while(dr - st > 1) {
    int mid = (st + dr) / 2;
    if(vect[k][mid] <= n)
      st = mid;
    else
      dr = mid;
  }
  return vect[k][st];
}

int main() {
  int t, n, k;
  for(int i = 0; i <= 7; ++i)
    top[i]++;
  for(int d = 2; d <= MAX_E; ++d) {
    if(ciur[d] == 0) {
      for(int i = d; i <= MAX_E; i = i + d)
        ciur[i]++;
    }
    if(ciur[d] <= 7)
      vect[ciur[d]][top[ciur[d]]++] = d;
  }
  FILE *fout = fopen("divprim.out", "w");
  fin >> t;
  for(int i = 0; i < t; ++i) {
    fin >> n >> k;
    fprintf(fout, "%d\n", bins(0, top[k], k, n));
  }
  fclose(fout);
  return 0;
}