// 
#include<bits/stdc++.h>
using namespace std;
const int N=(1<<16)+10,M=105;
int T;
int type;
int cnt,a[M];
unsigned long long dp[M][N][2];
unsigned long long dfs(int pos,bool limit,int now){
    if(!pos){
    	return 1;
	}
    if(!limit&&dp[pos][now][(type==10)?0:1]!=-1){
    	return dp[pos][now][(type==10)?0:1];
	}
    int up=limit?a[pos]:type-1,res=0;
    for(int i=0;i<=up;i++){
        if((now>>i)&1){
        	continue;
		}
        if(now==0&&i==0){
        	res+=dfs(pos-1,limit&&i==up,now);
		}
        else{
        	res+=dfs(pos-1,limit&&i==up,now|(1<<i));
		}
    }
    if(!limit){
    	dp[pos][now][(type==10)?0:1]=res;
	}
    return res;
}
unsigned long long solve(unsigned long long x){
    cnt=0;
    while(x){
        a[++cnt]=x%type;
        x/=type;
    }
    return dfs(cnt,1,0);
}
unsigned long long read(){
    unsigned long long x=0;
    char s[22];
    scanf("%s",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;
		}
    }
    return x;
}
void print(unsigned long long x){
    if(x==0){
        printf("0\n");
        return ;
    }
    if(type==10){
    	printf("%llu\n", x);
	}
    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){
            	printf("%c",ans[i]-10+'a');
			}
            else{
            	printf("%c",ans[i]+'0');
			}
        }
        printf("\n");
    }
}
signed main(){
    memset(dp,-1,sizeof dp);
    scanf("%d",&T);
    while(T--){
        char op[10];
        scanf("%s",op);
        if(op[0]=='d'){
        	type=10;
		}
        else{
        	type=16;
		}
        int flag;
        scanf("%d",&flag);
        if(!flag){
            unsigned long long a=read(),b=read();
            unsigned long long ans=solve(b);
            if(a>0){
            	ans-=solve(a-1);
			}
            print(ans);
        }
        else{
            unsigned long long x=read();
            if(x<10){
                printf("%llu\n",x-1);
                continue;
            }
            unsigned long long l=0,r=0,ans=0;
			r--;
            if(solve(r)<x){
                printf("-\n");
                continue;
            }
            while(l<=r){
                unsigned long long mid=(l+r)>>1;
                if(solve(mid)>=x){
                	ans=mid;
                	r=mid-1;
				}
				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 fffffffffffffff
*/