#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;


void solve() {
	ll k, X; cin >> k >> X;
	X--;
	ll len = 1, cnt = k;
	while (X >= cnt) {
		X -= cnt;
		cnt *= k;
		len++;
	}
	string out = "";
	for (int i = 0; i < len; i++) {
		out += (X%k) + '0' + 10-k;
		X /= k;
	}
	reverse(out.begin(), out.end());
	cout << out << endl;
}
int main() {

	int t; cin >> t;
	while (t--) solve();
}