#include<fstream>
#include<cmath>
#include<bitset>
using namespace std;

ifstream f("progresie.in");
ofstream g("progresie.out");

int main()
{
	bool gasit = false;
	long long t, n, r, i,dim = 1,j,aux,curent = 0,ultimu;
	f >> t;
	while (t)
	{
		dim = 1;
		gasit = false;
		i = 1;
		f >> n >> r;
		while (!gasit) {
			aux = n-1;
			j = 1;
			while (aux)
			{
				curent = j * r + i;
				ultimu = ceil(sqrt(curent));
				if (ultimu * (ultimu-1) >= curent)
					break;
				++j;
				--aux;
			}
			if (aux == 0) {
				gasit = true;
				g << i << '\n';
				break;
			}
			i++;
			if (i > dim*dim) {
				i += dim;
				++dim;
			}
		}
		--t;
	}
	return 0;
}