#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define int long long 
#define endl "\n"
const int N = 3e5+10;
int n,m,k;
typedef pair<int,int> PII;
int get(int x ,int cnt)
{
    int res = 1;
    for(int i= 1;i <= cnt;i ++)res*=x;
    return res;
}
void solve()
{
    cin>>n>>m;
    vector<int>ans;
    int sum = 0;
    int tem = 0;
    for(int i = 1;;i ++)
    {
        tem+=get(n,i);
        if(m<=tem){
            map<int,int>mp;
            int cnt= 0;
            for(int j = 9-n+1;j <= 9;j ++)mp[cnt++]=j;
            vector<int>res;
            for(int j = 0;j < i;j ++)res.push_back(0);
            tem-=get(n,i);
            m-=tem;
            vector<int>ans;
            
            m--;
            while(m){
                ans.push_back(m%n);
                m/=n;
            }
            for(int j = 0;j < ans.size();j ++)
            {
                
                res[j]+=ans[j];
                // cout<<res[j]<<endl;
            }
            reverse(res.begin(),res.end());
            for(int j = 0;j < i;j ++)
            {
                char c= mp[res[j]]+'0';
                cout<<c;
            }
            cout<<endl;
            return;
        }
    }
}
signed  main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
   int t=1;
   cin>>t;
   while(t--)
   {
       solve();
   }
    return 0;
}