// 
#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int MAXN = (1 << 16) + 1;
ull dp[2][22][MAXN];
int type , a[100];
ull dfs(int pos, int sta, int limit) {
    if (pos == -1) return 1;
    if (dp[(type == 16)][pos][sta] != -1 && !limit) return dp[(type == 16)][pos][sta];
    int up = limit ? a[pos] : (type - 1);
    ull res = 0;
    for (int i = 0; i <= up; i++) {
        if ((sta >> i) & 1) continue;
        if (sta == 0 && i == 0) res += dfs(pos - 1 , sta , limit && i == up);
        else res += dfs(pos - 1 , sta | (1 << i) , limit && i == up);
    }
    if (!limit) dp[(type == 16)][pos][sta] = res;
    return res;
}
ull solve(ull x) {
    int pos = 0;
    while (x) {
        a[pos ++] = x % type;
        x /= type;
    }
    return dfs(pos - 1 , 0 , 1);
}
void input(ull &x) {
    x = 0;
    char s[22];
    cin >> (s + 1);
    int len = strlen(s + 1);
    for (int i = 1 ; i <= len ; i ++) {
        if (s[i] <= '9' && s[i] >= '0') x = x * type + s[i] - '0';
        else x = x * type + s[i] - 'a' + 10;
    }
}
void print(ull x) {
    if (x == 0) {
    	cout << 0 << '\n';
        return;
    }
    if (type == 10) cout << x << '\n';
    else {
        vector<int> ans;
        while (x) {
            int p = x % type;
            x /= type;
            ans.push_back(p);
        }
        for (int i = ans.size() - 1; i >= 0; i--) {
            if (ans[i] >= 10) cout << char(ans[i] - 10 + 'a');
            else cout << char(ans[i] + '0');
        }
        cout << '\n';
    }
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr) , cout.tie(nullptr);
    memset(dp , -1 , sizeof(dp));
    int T;
    cin >> T;
    while (T --) {
        char op[10];
        cin >> op;
        if (op[0] == 'd') type = 10;
        else type = 16;
        int flag;
        cin >> flag;
        if (!flag) {
            ull a , b;
            input(a) , input(b);
            ull ans = solve(b);
            if (a > 0) ans -= solve(a - 1);
            print(ans);
        } else {
            ull x;
            input(x);
            if (x < 10) {
            	cout << x - 1 << '\n';
                continue;
            }
            ull l = 0 , r = 0 , ans = 0;
            r --;
            if (solve(r) < x) {
                cout << '-' << '\n';
                continue;
            }
            while (l <= r) {
                ull mid = l + (r - l) / 2;
                if (solve(mid) >= x) r = mid - 1, ans = mid;
                else l = mid + 1;
            }
            print(ans);
        }
    }
}
/*
6
d 0 10 20
h 0 10 1f
d 1 10
h 1 f
d 1 1000000000
h 1 ffffffffffffffff

*/