// 
//½øÖÆת»»ºÃÌâ°¡ 
#include<bits/stdc++.h>
typedef unsigned long long ll;
using namespace std;
int a[25], B, cnt;
ll f[2][2][25][1 << 16], l, r;
ll dfs(int pos, int tmp, bool limit, bool flg) {
	if(pos == -1) return 1;
	if(!limit && f[flg][B == 10][pos][tmp] != 18446744073709551615ull) return f[flg][B == 10][pos][tmp];
	ll up = limit ? a[pos] : B - 1, res = 0;
	for(int i = 0; i <= up; i++) if(!(flg | (i > 0)) || !(tmp & (1 << i))) res += dfs(pos - 1, (flg | (i > 0)) ? (tmp | (1 << i)) : tmp, limit & (i == up), flg | (i > 0));
	if(!limit) f[flg][B == 10][pos][tmp] = res;
	return res;
}
ll init(ll x) {
	if(x == 18446744073709551615ull) return 0;
	cnt = 0;
	while(x) a[cnt++] = x % B, x /= B; 
	return dfs(cnt - 1, 0, 1, 0);
} 
ll read() {
	ll qpow = 1, sum = 0;
	string s;
	cin>>s;
	for(int i = s.length() - 1; ~i; i--) {
		int p = (('0' <= s[i] && s[i] <= '9') ? s[i] - '0' : (s[i] - 'a' + 10));
		sum += p * qpow;
		qpow *= B;  
	}
	return sum;
}
void print(ll x) {
	if(x == 0) return cout<<0<<'\n', void();
	cnt = 0; while(x) a[cnt++] = x % B, x /= B;
	for(int i = cnt - 1; ~i; i--) {
		if(a[i] <= 9) cout<<a[i];
		else cout<<char(a[i] - 10 + 'a');
	}
	cout<<'\n';
}
void solve() {
	char opt;
	cin>>opt; 
	if(opt == 'd') B = 10; else B = 16;
	cin>>opt;
	if(opt == '0') {
		l = read(), r = read();
		print(init(r) - ((l > 0) ? init(l - 1) : 0));
	} else if(opt == '1') {
		l = read();
		if(l == 1) return cout<<"0\n", void();
		ll L = 0, R = 9223372036854775807ll, mid, ans = -1;
		while(L <= R) {
			mid = L + R >> 1;	
			if(init(mid) >= l) ans = mid, R = mid - 1;
			else L = mid + 1;
		}
		if(ans == -1) cout<<'-'<<'\n';
		else print(ans);
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	memset(f, -1, sizeof f);
	int t; cin>>t;
	while(t--) solve();
	return 0;
}