import sys
readline=sys.stdin.readline

def Bisect_Int(ok,ng,is_ok):
    while abs(ok-ng)>1:
        mid=(ok+ng)//2
        if is_ok(mid):
            ok=mid
        else:
            ng=mid
    return ok

def check(a,b,c):
    if a==b:
        return False
    if a==c:
        return False
    if b==c:
        return False
    return b in (max(a,b,c),min(a,b,c))

def solve(N):
    N=list(map(int,list(str(N))))
    dp=[[0]*10 for i in range(10)]
    for a in range(1,10):
        for b in range(10):
            if (a,b)<(N[0],N[1]):
                dp[a][b]+=1
    cur=(N[0],N[1])
    for i in range(2,len(N)):
        n=N[i]
        prev=dp
        dp=[[0]*10 for a in range(10)]
        for a in range(10):
            for b in range(10):
                for c in range(10):
                    if check(a,b,c):
                        dp[b][c]+=prev[a][b]
        if cur!=None:
            a,b=cur
            for c in range(n):
                if check(a,b,c):
                    dp[b][c]+=1
        if i!=len(N)-1:
            for a in range(1,10):
                for b in range(10):
                    dp[a][b]+=1
        if cur!=None:
            a,b=cur
            c=n
            if check(a,b,c):
                cur=(b,c)
            else:
                cur=None
    return sum(dp[a][b] for a in range(10) for b in range(10))

T=int(readline())
for t in range(T):
    K=int(readline())
    def is_ok(ans):
        return solve(ans)<K
    ans=Bisect_Int(101,1<<50,is_ok)
    print(ans)