def solve():
    M = int(input())
    d = [0] + list(map(int, input().split()))

    if all(d[i] == 0 for i in range(10)):
        return M

    a = 0
    for k in range(1, 10):
        for _ in range(d[k]):
            a = 10 * a + k

    b = (-a * pow(10, 9)) % M
    return a * pow(10, 9) + b

#==================================================
import sys
input = sys.stdin.readline
write = sys.stdout.write

T = int(input())
write("\n".join(map(str, [solve() for _ in range(T)])))