// 
#include<bits/stdc++.h>
typedef unsigned long long ull;
ull dp[2][21][65536];
int a[21],len,B;
ull dfs(int dep,int s,bool pre,bool lim){
	if(!dep)return 1;
	if(!lim&&!pre&&~dp[B==16][dep][s])return dp[B==16][dep][s];
	ull res=0;
	const int up=lim?a[dep]:B-1;
	for(int i=0;i<=up;++i)
		if(!(s>>i&1))
			if(pre&(!i))res+=dfs(dep-1,0,true,lim&(!a[dep]));
			else res+=dfs(dep-1,s|(1<<i),false,lim&(i==a[dep]));
	if(!lim&&!pre)dp[B==16][dep][s]=res;
	return res;
}
inline ull solve(ull n){
	len=0;
	for(ull i=n;i;i/=B)a[++len]=i%B;
	return dfs(len,0,true,true);
}
int T;
ull l,r;
int main(){
	memset(dp,-1,sizeof(dp));
	scanf("%d",&T);
	for(char tp,op;T--;){
		scanf("\n %c %c",&tp,&op);
		B=tp=='d'?10:16;
		if(op=='0'){
			scanf(tp=='d'?"%llu%llu":"%llx%llx",&l,&r);
			printf(tp=='d'?"%llu\n":"%llx\n",solve(r)-(l?solve(l-1):0));
		}else{
			static ull x,res;
			scanf(tp=='d'?"%llu":"%llx",&x);
			if(x>(tp=='d'?8877691:53319412081141)){
				puts("-");
				continue;
			}
			if(x==1){
				puts("0");
				continue;
			}
			l=0;r=0xffffffffffffffff;
			while(l<=r){
				ull mid=l+(r-l>>1);
				if(solve(mid)>=x)res=mid,r=mid-1;
				else l=mid+1;
			}
			printf(tp=='d'?"%llu\n":"%llx\n",res);
		}
	}
	return 0;
}