#include <bits/stdc++.h>

#define f(i,a,b) for(int i = (a); i <= (b); i++)
#define SZ(x) ((int)x.size())

typedef long long ll;

using namespace std;

char S[30];
int K, T, N;

bool isBigger(int l, int r, int k)
{
    ll x = 1;
    f(i,l,r)
    {
        ll limit = k/x;
        if(i > limit) return true;
        x *= i;
    }
    return false;
}

int main()
{
    cin >> T;
    f(tt,1,T)
    {
        string str;
        cin >> str >> K;
        K--;
        N = SZ(str);
        f(i,1,N) S[i] = str[i-1];
        string ans = "";
        f(i,1,N)
        {
            if(isBigger(i+1,N,K))
            {
                ans = S[i] + ans;
                continue;
            }
            int mul = 1;
            f(x,i+1,N) mul *= x;
            int pos = K/mul;
            ans = ans.substr(0,pos) + S[i] + ans.substr(pos);
            K %= mul;
        }
        cout << ans << "\n";
    }
}