import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.buffer.readline()[:-1]

def main():
    def iskado(a,b,c):
        if (a,b)==(10,0) or (b,c)==(10,0):return False
        if a<10 and b==10:return False
        if a==10 and b!=c:return True
        if a==b or a==c or b==c:return False
        if a<b<c or a>b>c:return False
        return True

    def less(m):
        s=str(m)
        sn=len(s)
        dp=[[[[0]*2 for _ in range(11)] for _ in range(11)] for _ in range(sn+1)]
        dp[0][10][10][0]=1
        for i in range(1,sn):dp[i][10][10][1]=1
        for i,c in enumerate(s):
            c=int(c)
            for j in range(11):
                if i==sn-1 and j==10:break
                for k in range(11):
                    for f in range(2):
                        pre = dp[i][j][k][f]
                        if pre==0:continue
                        if f==0 and iskado(j,k,c):dp[i+1][k][c][0]+=pre
                        end=10 if f else c
                        for nk in range(end):
                            if iskado(j,k,nk):
                                dp[i+1][k][nk][1]+=pre
        sm=sum(dp[sn][j][k][f] for j in range(10) for k in range(10) for f in range(2))
        return sm<K

    t=II()
    for _ in range(t):
        K=II()
        l=101
        r=37294859064824
        # 自分以下の門松ナンバーがk個未満か
        while l+1<r:
            m=(l+r)//2
            if less(m):l=m
            else:r=m
        print(r)

main()