#include<bits/stdc++.h>
#define MAXL (23)
#define MAXS (65539)
#define ll long long
#define ull unsigned long long
using namespace std;
const int mod=20130427;
void File()
{
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
}
template<typename type>
void read(type &x)
{
    bool f=0;char ch=0;x=0;
    while(ch<'0'||ch>'9'){f|=!(ch^'-');ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    x=f?-x:x;
}
template<typename type,typename... Args>
void read(type &x,Args &... args)
{
    read(x);
    read(args...);
}
bool vis[MAXL][MAXS][2][2];
char typ;
int test,qtyp,len;
int bas[2]={10,16},dig[MAXL];
ull L,R,pos,ans;
ull f[MAXL][MAXS][2][2];
ull dfs(int dep,int sta,bool lead,bool opt,bool up)
{
    if(!dep) return lead?0:1;
    if(!up&&vis[dep][sta][lead?1:0][opt?1:0]) return f[dep][sta][lead?1:0][opt?1:0];
    ull res=0;
    int lim=up?dig[dep]:(bas[opt?1:0]-1);
    for(int i=0;i<=lim;i++) if(!((sta>>i)&1)) res+=dfs(dep-1,(lead&&i==0)?0:sta|(1<<i),lead&&i==0,opt,up&&i==lim);
    if(!up) vis[dep][sta][lead?1:0][opt?1:0]=1,f[dep][sta][lead?1:0][opt?1:0]=res;
    return res;
}
ull fc(ull x)
{
    len=0;
    int t=typ=='d'?0:1;
    while(x)
    {
        dig[++len]=x%bas[t];
        x/=bas[t];
    }
    return dfs(len,0,1,t,1);
}
inline bool isdig(char ch){return (ch>='0'&&ch<='9')||(ch>='a'&&ch<='f');}
inline int getdig(char ch){return (ch>='0'&&ch<='9')?(ch-'0'):(ch-'a'+10);}
void input(ull &x)
{
    if(typ=='d') read(x);
    else
    {
        x=0;char ch=0;
        while(!isdig(ch)) ch=getchar();
        while(isdig(ch))
        {
            x=(x<<4)+getdig(ch);
            ch=getchar();
        }
    }
}
void output(ull x)
{
    // printf("OUTPUT=%llu\n",x);
    if(!x){printf("0\n");return;}
    if(typ=='d') printf("%llu\n",x);
    else
    {
        vector<int> dig;
        while(x) dig.push_back(x&15),x>>=4;
        reverse(dig.begin(),dig.end());
        for(int t:dig) putchar(t<10?(t+'0'):(t-10+'a'));
        printf("\n");
    }
}
inline void solve()
{
    cin>>typ;
    read(qtyp);
    if(!qtyp)
    {
        input(L),input(R);
        // printf("[%llu,%llu]\n",L,R);
        ans=fc(R)-(L?fc(L-1):(-1));
        output(ans);
    }
    else
    {
        input(pos);
        if(pos<9)
        {
            output(pos-1);
            return;
        }
        ull l=0,r=9876543210,res=-1;
        while(l<=r)
        {
            ull mid=l+r>>1;
            if(fc(mid)+1>=pos)
            {
                res=mid;
                r=mid-1;
            }
            else l=mid+1;
        }
        if(~res) output(res);
        else printf("-\n");
    }
}
int main()
{
#ifndef ONLINE_JUDGE
    File();
#endif
    read(test);
    for(int i=1;i<=test;i++) solve();
}