#include <bits/stdc++.h> 
using namespace std;  
 
typedef long long ll;  
typedef pair<int, int> ii;  
 
// Tìm số x đầu tiên sao cho (số lượng số <= x và không chia hết cho n) >= k 
// Số lượng số <= x và không chia hết cho n = x - (số lượng số <= x và chia hết cho n)
ll f(ll mid, int n) {
	return mid - mid / n;  
}
 
void solve() {
	int n, k; 
	cin >> n >> k;  
 
	ll l = 1, r = 2e9, ans = -1;  
	while (l <= r) {
		ll mid = (l + r) >> 1; 
 
		if (f(mid, n) >= k) {
			ans = mid;  
			r = mid - 1;   
		}
		else {
			l = mid + 1;   
		}
	}
 
	cout << ans << '\n'; 
}
 
int main() {
	ios::sync_with_stdio(0); cin.tie(0);  	
	int q; cin >> q;
	while (q--) {
		solve();  
	}
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+IAp1c2luZyBuYW1lc3BhY2Ugc3RkOyAgCgp0eXBlZGVmIGxvbmcgbG9uZyBsbDsgIAp0eXBlZGVmIHBhaXI8aW50LCBpbnQ+IGlpOyAgCgovLyBUw6xtIHPhu5EgeCDEkeG6p3UgdGnDqm4gc2FvIGNobyAoc+G7kSBsxrDhu6NuZyBz4buRIDw9IHggdsOgIGtow7RuZyBjaGlhIGjhur90IGNobyBuKSA+PSBrIAovLyBT4buRIGzGsOG7o25nIHPhu5EgPD0geCB2w6Aga2jDtG5nIGNoaWEgaOG6v3QgY2hvIG4gPSB4IC0gKHPhu5EgbMaw4bujbmcgc+G7kSA8PSB4IHbDoCBjaGlhIGjhur90IGNobyBuKQpsbCBmKGxsIG1pZCwgaW50IG4pIHsKCXJldHVybiBtaWQgLSBtaWQgLyBuOyAgCn0KCnZvaWQgc29sdmUoKSB7CglpbnQgbiwgazsgCgljaW4gPj4gbiA+PiBrOyAgCgoJbGwgbCA9IDEsIHIgPSAyZTksIGFucyA9IC0xOyAgCgl3aGlsZSAobCA8PSByKSB7CgkJbGwgbWlkID0gKGwgKyByKSA+PiAxOyAKCQkKCQlpZiAoZihtaWQsIG4pID49IGspIHsKCQkJYW5zID0gbWlkOyAgCgkJCXIgPSBtaWQgLSAxOyAgIAoJCX0KCQllbHNlIHsKCQkJbCA9IG1pZCArIDE7ICAgCgkJfQoJfQoKCWNvdXQgPDwgYW5zIDw8ICdcbic7IAp9CgppbnQgbWFpbigpIHsKCWlvczo6c3luY193aXRoX3N0ZGlvKDApOyBjaW4udGllKDApOyAgCQoJaW50IHE7IGNpbiA+PiBxOwoJd2hpbGUgKHEtLSkgewoJCXNvbHZlKCk7ICAKCX0KfQ==

NgozIDcKNCAxMgoyIDEwMDAwMDAwMDAKNyA5NwoxMDAwMDAwMDAwIDEwMDAwMDAwMDAKMiAxIA==

6
3 7
4 12
2 1000000000
7 97
1000000000 1000000000
2 1