#include<bits/stdc++.h>
#define ll long long
#define Ull unsigned ll
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PPIII pair<PII,int>
#define PLPII pair<ll,PII>
#define fi first
#define se second
using namespace std;
int Q,num[21],nt;
ll f1[15][1<<10],f2[21][1<<16];
inline int id(char x){return x<='9'&&x>='0'?x-'0':x-'a'+10;}
ll DFS1(int i,int j,int S)
{
    if(!i)return 1;
    if(j>1&&~f1[i][S])return f1[i][S];
    ll sum=0;
    if(!j)sum+=DFS1(i-1,0,S);
    for(int o=!j;o<=((j==1||((!j&&i==nt)))?num[i]:9);o++)if(!(S>>o&1))
    {
        sum+=DFS1(i-1,((j==1||((!j&&i==nt)))&&o==num[i])?1:2,S^(1<<o));
    }
    if(j>1)f1[i][S]=sum;
    // if(i==nt)
    // {
    //     puts("-------------------------");
    //     for(int i=nt;i;i--)printf("%d ",num[i]);puts("");
    //     printf("%lld\n",sum);
    //     puts("-------------------------");
    // }
    return sum;
}
ll DFS2(int i,int j,int S)
{
    if(!i)return 1;
    if(j>1&&~f2[i][S])return f2[i][S];
    ll sum=0;
    if(!j)sum+=DFS2(i-1,0,S);
    for(int o=!j;o<=((j==1||((!j&&i==nt)))?num[i]:15);o++)if(!(S>>o&1))
    {
        sum+=DFS2(i-1,((j==1||((!j&&i==nt)))&&o==num[i])?1:2,S^(1<<o));
    }
    if(j>1)f2[i][S]=sum;
    // if(i==nt)
    // {
    //     puts("+++++++++++++++++++++++++");
    //     for(int i=nt;i;i--)printf("%d ",num[i]);puts("");
    //     printf("%lld\n",sum);
    //     puts("+++++++++++++++++++++++++");
    // }
    return sum;
}
ll Solve_d0()
{
    return DFS1(nt,0,0);
}
ll Solve_f0()
{
    return DFS2(nt,0,0);
}
void Solve_d1(Ull C)
{
    if(C>8877691)return puts("-"),void();
    memset(num,0,sizeof(num));
    bool Flag=0;
    for(int i=10;i;i--)
    {
        if(!Flag)nt=i;
        int l=1,r=9;
        while(l<=r)
        {
            int mid=l+r>>1;
            num[i]=mid;
            if(Solve_d0()<C)l=mid+1;
            else r=mid-1;
        }
        if(r)Flag=1;
        num[i]=r;
    }
    int sg=1;
    while(sg<=nt&&num[sg]==9)num[sg++]=0;
    if(sg<=nt)++num[sg];
    else num[++nt]=1;
    for(int i=nt;i;i--)printf("%d",num[i]);puts("");
}
void Solve_f1(Ull C)
{
    if(C>53319412081141)return puts("-"),void();
    memset(num,0,sizeof(num));
    bool Flag=0;
    for(int i=16;i;i--)
    {
        if(!Flag)nt=i;
        int l=1,r=15;
        while(l<=r)
        {
            int mid=l+r>>1;
            num[i]=mid;
            // for(int i=nt;i;i--)printf("%c",num[i]<10?num[i]+'0':num[i]-10+'a');puts("");
            // printf("%lld %lld\n",Solve_f0(),C);
            if(Solve_f0()<C)l=mid+1;
            else r=mid-1;
        }
        if(r)Flag=1;
        num[i]=r;
    }
    int sg=1;
    while(sg<=nt&&num[sg]==15)num[sg++]=0;
    if(sg<=nt)++num[sg];
    else num[++nt]=1;
    for(int i=nt;i;i--)printf("%c",num[i]<10?num[i]+'0':num[i]-10+'a');puts("");
}
void Print_f(ll x)
{
    if(x>15)Print_f(x/16);
    printf("%c",x%16<10?x%16+'0':x%16-10+'a');
}
int main()
{
	#ifndef ONLINE_JUDGE
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
	#endif
    
    memset(f1,-1,sizeof(f1));
    memset(f2,-1,sizeof(f2));
    scanf("%d",&Q);
    while(Q--)
    {
        char op1[5],x[21],y[21];
        int op2;
        Ull z=0;
        scanf("%s%d%s",op1,&op2,x);
        if(op2)
        {
            nt=strlen(x);
            for(int i=0;i<nt;i++)z=z*(op1[0]=='d'?10:16)+id(x[i]);
            // printf("z=%llu\n",z);
            if(op1[0]=='d')Solve_d1(z);
            else Solve_f1(z);
        }
        else
        {
            scanf("%s",y);
            nt=strlen(y);
            for(int i=0;i<nt;i++)num[nt-i]=id(y[i]);
            ll sum;
            if(op1[0]=='d')sum=Solve_d0();
            else sum=Solve_f0();
            nt=strlen(x);
            for(int i=0;i<nt;i++)num[nt-i]=id(x[i]);
            if(nt>1||num[1])
            {
                int sg=1;
                while(!num[sg])num[sg++]=op1[0]=='d'?9:15;
                if(!--num[sg]&&sg==nt)--nt;
                if(op1[0]=='d')sum-=Solve_d0();
                else sum-=Solve_f0();
            }
            if(op1[0]=='d')printf("%lld\n",sum);
            else Print_f(sum),puts("");
        }
    }
    
    cerr<<1.0*clock()/CLOCKS_PER_SEC<<'\n';
}