#include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
using vl = vector<ll>;
using sl = set<ll>;
#define ov4(a, b, c, d, name, ...) name
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define all(v) v.begin(), v.end()
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vc<vc<T>>;
void solve() {
    char c;
    ll t;
    cin >> c >> t;
    auto get = [](char c) {
        if ('0' <= c and c <= '9') return c - '0';
        return c - 'a' + 10;
    };
    auto get2 = [&](ll x) {
        if (x < 10) return '0' + x;
        return 'a' + x - 10;
    };
    vc<ll> valsd = {1, 9};
    for (ll i = 9; i >= 1; i--) valsd.push_back(valsd.back() * i);
    auto sumd = valsd;
    rep(i, 1, valsd.size()) sumd[i] += sumd[i - 1];
    vc<ll> valsh = {1, 15};
    for (ll i = 15; i >= 1; i--) valsh.push_back(valsh.back() * i);
    auto sumh = valsh;
    rep(i, 1, valsh.size()) sumh[i] += sumh[i - 1];
    auto h2d = [&](string s, ll type) {
        ll res = 0;
        ll MA = (type == 0 ? 10 : 16);
        for (auto S : s) {
            res *= MA;
            res += get(S);
            if (res > sumh.back()) return res;
        }
        return res;
    };
    auto d2h = [&](ll x, ll type) {
        if (x == 0) return to_string(x);
        ll MA = (type == 0 ? 10 : 16);
        string res;
        while (x) {
            res += get2(x % MA);
            x /= MA;
        }
        reverse(res.begin(), res.end());
        return res;
    };
    auto f = [&](string s, ll type) -> ll {
        ll ns = s.size();
        vvc<ll> dp(ns + 1, vc<ll>(2));
        dp[1][1] = 1;
        dp[1][0] = get(s[0]) - 1;
        set<ll> st;
        st.insert(get(s[0]));
        ll MA = (type == 0 ? 10 : 16);
        rep(i, 2, ns + 1) {
            ll val = get(s[i - 1]);
            dp[i][0] += dp[i - 1][0] * (MA + 1 - i);
            if (!st.count(val)) dp[i][1] = dp[i - 1][1];
            st.insert(val);
            ll r = val;
            rep(j, val) if (st.count(j)) r--;
            dp[i][0] += dp[i - 1][1] * r;
            dp[i][0] += MA - 1;
        }
        return 1 + dp[ns][0] + dp[ns][1];
    };
    ll type = c == 'h';
    if (t == 0) {
        string l, r;
        cin >> l >> r;
        ll val = h2d(r, type);
        string s = d2h(val, type);
        ll res = f(s, type);
        if (l != "0") {
            val = h2d(l, type) - 1;
            s = d2h(val, type);
            res -= f(s, type);
        }
        cout << d2h(res, type) << endl;
        return;
    }
    string i;
    cin >> i;
    ll r = h2d(i, type) + 1;
    if (type == 0) {
        if (r > sumd.back()) {
            cout << "-" << endl;
            return;
        }
    } else {
        if (r > sumh.back()) {
            cout << "-" << endl;
            return;
        }
    }
    ll R = r - 1;
    ll l = 0;
    while (r - l > 1) {
        ll mid = (l + r) / 2;
        ll val = f(d2h(mid, type), type);
        if (val < R)
            l = mid;
        else
            r = mid;
    }
    if (type)
        cout << d2h(r, type) << endl;
    else
        cout << r << endl;
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(20);
    ll t = 1;
    cin >> t;
    rep(t) solve();
}