def solve(M, A):
    from itertools import permutations

    digit = []
    for i in range(9):
        for _ in range(A[i]):
            digit.append(i + 1)
    P = list(permutations(digit))
    for per in P:
        tmp = 0
        for c in per:
            tmp *= 10
            tmp += c
        if tmp % M == 0:
            return tmp


ans = []
T = int(input())
for _ in range(T):
    M = int(input())
    A = list(map(int, input().split()))
    ans.append(solve(M, A))
print(*ans, sep="\n")