#include <cstdio>
#include <cstring>
#include <vector>

const int N = 25;
int n, base[2] = {10, 16};
unsigned long long dp[N][N], leqlen[N][N];

int fromchar(char c) {
	if (c <= '9' && c >= '0') return c - '0';
	else return c - 'a' + 10;
}

char tochar(int c) {
	if (c >= 10) return 'a' + c - 10;
	return '0' + c;
}

void outhex(unsigned long long x) {
	if (!x) {
		printf("0");
		return;
	}
	std::vector<int> repr;
	while (x) {
		repr.push_back(x % 16);
		x /= 16;
	}
	for (int i = (int)repr.size() - 1; i >= 0; --i) {
		int c = repr[i];
		if (c < 10) printf("%d", c);
		else printf("%c", 'a' + c - 10);
	}
	printf("\n");
}

unsigned long long readhex() {
	char s[N];
	scanf("%s", s);
	unsigned long long r = 0;
	for (int i = 0; s[i]; ++i) {
		r *= 16;
		r += fromchar(s[i]);
	}
	return r;
}

unsigned long long f(const char *s, int b, bool last) {
	if (s[0] == '0') return last;
	int len = strlen(s), avail = base[b];
	bool u[N] = {0};
	unsigned long long ans = leqlen[len - 1][avail];
	for (int i = 0; s[i]; ++i) {
		int c = fromchar(s[i]);
		if (avail - i - 1 < 0) return ans;
		for (int j = 0 + (!i); j < c; ++j) if (!u[j]) ans += dp[len - i - 1][avail - i - 1];
		if (u[c]) return ans;
		u[c] = true;
	}
	return ans + (unsigned long long)last;
}

void solve(unsigned long long ind, bool b) {
	if (ind == 1) {
		printf("0\n");
		return;
	}
	int len, avail = base[b];
	--ind;
	for (len = 0; len < N && leqlen[len][avail] <= ind; ++len);
	if (len == N) printf("-\n");
	else {
		ind -= leqlen[len - 1][avail];
		bool u[N] = {0};
		for (int i = 0; i < len; ++i) {
			int j = 0;
			if (!i) ++j;
			--avail;
			for (; dp[len - i - 1][avail] <= ind; ++j) {
				if (!u[j]) ind -= dp[len - i - 1][avail];
			}
			while (u[j]) ++j;
			printf("%c", tochar(j));
			u[j] = 1;
		}
		printf("\n");
	}
}
/*
#include <random>

void solve1(unsigned long long ind, bool b) {
	unsigned long long l = 0, r = (unsigned long long)0 - 1;
	printf("rmost %llu\n", r);
	while (l < r) {
		unsigned long long m = l + (r - l) / 2;
		if (f(std::to_string(m).c_str(), 0, 
	}
}
*/

int main() {
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j) {
			if (!i) dp[i][j] = leqlen[i][j] = 1;
			else {
				if (j) dp[i][j] = j * dp[i - 1][j - 1];
				leqlen[i][j] = leqlen[i - 1][j] + (j ? dp[i - 1][j - 1] * (j - 1) : 0);
			}
		}
	}
	scanf("%d", &n);
	/*
	std::mt19937 rng(228);
	while (n--) {
		int x = rng() % 100;
		printf("%d: f %llu ", x, f(std::to_string(x).c_str(), 0, 1));
		solve(x, 0);
	}
	return 0;
	*/
	while (n--) {
		int type;
		char b;
		scanf(" %c%d", &b, &type);
		b = b == 'd' ? 0 : 1;
		if (type == 0) {
			char l[N], r[N];
			scanf("%s%s", l, r);
			unsigned long long ans = f(r, b, 1) - f(l, b, 0);
			if (b == 1) outhex(ans);
			else printf("%llu\n", ans);
		} else {
			unsigned long long ind;
			if (b == 1) ind = readhex();
			else scanf("%llu", &ind);
			solve(ind, b);
			//solve1(ind, b);
		}
	}
	return 0;
}