#include<fstream>
#include<vector>
#include<vector>
#include<cstdlib>
#include<iostream>
using namespace std;
vector<int>v(100000009,0);
vector<int>haha[8];
int n;
ifstream f("divprim.in");
ofstream g("divprim.out");
void ciur()
{
	int i,j;
	for(i=2;i<=100000000;i++)
	{
		if(v[i]==0)
		for(j=1;j*i<=100000000;j++)
			v[i*j]++;
		if(v[i]>=0&&v[i]<=7)
			haha[v[i]].push_back(i);
	}
}
int cautare_binara(vector<int>vec,int st,int dr,int x)
{
	int mij=(st+dr)/2;
	if(st<dr)
	{
		if(vec[mij]<x)
			return cautare_binara(vec,mij+1,dr,x);
		else
			if(vec[mij]>x)
				return cautare_binara(vec,st,mij-1,x);
	}
	return st;
}
int main()
{
	int poz,j,i,N,K,T,lungime;
	for(i=0;i<=7;i++)
		haha[i].push_back(0);
	ciur();
	haha[0].push_back(1);
	f>>T;
	for(i=1;i<=T;i++)
	{
		f>>N>>K;
		lungime=haha[K].size()-1;
		poz=cautare_binara(haha[K],1,lungime,N);
		if(haha[K][poz]>N)
			g<<haha[K][poz-1]<<endl;
		else
			g<<haha[K][poz]<<endl;
	}
	f.close();g.close();
	return 0;
}