// 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
using namespace std;

int base; bool type;
void read(ull& x) { x = 0;
    string s; cin >> s;
    for (char c : s) {
        if (c >= 'a')  
            x = x*base+10+(c-'a');
        else
            x = x*base+(c-'0');
    }
}
string write(ull x) {
    // cout << "!" << x << "!" << '\n';
    string s;
    while (s.empty() || x) {
        if (x%base>9) 
            s += char('a'+(x%base)-10);
        else 
            s += char('0'+x%base);
        x /= base;
    }
    reverse(s.begin(), s.end());
    return s;
}

int a[25], len;
ull dp[2][25][1<<16]; bool vis[2][25][1<<16];
ull dfs(int pos, int sta, bool lim, bool qdl) {
    // 10 ~ 1f
    // 16 ~ 31
    if (!pos) return 1;
    ull& di = dp[type][pos][sta];
    bool& vi = vis[type][pos][sta];
    if (!lim && !qdl && vi) return di;
    int up = (lim?a[pos]:(base-1)); ull res = 0;
    for (int i = 0; i <= up; i++) {
        if ((sta&(1<<i)) || (qdl&&(i==0)))
            res += dfs(pos-1, (qdl&&(i==0))?sta:(sta^(1<<i)), lim&&(i==up), qdl&&(i==0));
    }
    if (!lim && !qdl) vi=1, di=res; return res;
}

ull solve(ull x, bool f) {
    // cout << "solving:" << x << ' ' << f << '\n';
    if (x==0) return f; x -= (!f);
    len=0; while (x) {
        a[++len] = x%base;
        x/=base;
    }
    // cout << dfs(len, (1<<base)-1, 1, 1) << '\n';
    return dfs(len, (1<<base)-1, 1, 1);
}

int main() {
    // g++ code.cpp -o code.exe -std=c++14 -O2 -fno-ms-extensions -DLOCAL; ./code
    time_t st = clock();
    
    #ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("ans.out", "w", stdout);
    #else
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    ios::sync_with_stdio();
    cin.tie(0), cout.tie(0);
    #endif

    int T, op; char dt;
    ull l, r, k;
    cin >> T; while (T--) {
        cin >> dt >> op;
        if (dt == 'd') base = 10, type = 0;
        if (dt == 'h') base = 16, type = 1;
        if (op == 0) {
            read(l); read(r);
            cout << write(solve(r,1)-solve(l,0)) << '\n';
        }
        if (op == 1) {
            read(k);
            ull l = 0, r, mid;
            if (base==10) r = 987654321;
            if (base==16) r = 1147797409030816545;
            while (l < r) {
                mid = l + r >> 1;
                if (solve(mid, 1) >= k) r = mid;
                else l = mid + 1;
            }
            if (solve(r, 1) < k) cout << '-' << '\n';
            else cout << write(r) << '\n';
        }
    }
    cerr << "Exec Time:" << (double)(clock()-st)/CLOCKS_PER_SEC << "s" << endl;
    return 0;
}