Problem: "Bless us and splash us , precious . Thats a meaty mouthful . " said Gollum on seeing 
Bilbo Baggins . Poor Bilbo Baggins is lost in the Misty Mountains and worst of all now he is 
stuck with Gollum who wants to finish him off. As Mr. Bilbo Baggins is clever , he convinced 
Gollum to play a game of riddles where if Bilbo answers correctly to the riddle given by Gollum ,
he wins and Gollum shows him the way out of the mountains . But if he loses , then Golumn would 
finish him off. Gollum gives Bilbo a fixed quantity of sand , say x units and also gives 
the quantity of sand required for each digit (1-9) , i.e he gives 9 numbers (x1,x2...x9) where xi 
represents sand required for ith digit . 
Now he ask Baggins to output the largest number possible using the given x units of sand.
Bilbo Baggins find this problem quite difficult and thus seeks your help .

Your task is simply to output the largest number possible which can be formed using x units of sand , given
sand required for each digit. If its impossible to form a number, print '-1'.
 

Input
First line contains integer T , the number of test cases. T testcases follow. The first line of each 
testcase contains integer n. Following n lines contain 9 integers , the amount of sand required for each number.  

Output
For each test case print largest number possible, if not possible to form the number , print  -1 .
 

Constraints
1 ≤ T ≤ 10
1 ≤n ≤ 10^6
1 ≤xi ≤ 10^5

SAMPLE INPUT
3
5
9 4 2 2 6 3 2 2 1
2
5 11 2 2 5 8 9 10 19
5
9 9 9 9 9 9 9 9 9

SAMPLE OUTPUT
99999
4
-1

Explanation

SAMPLE CASE 1 :
Maximum sand available is 5 units . So maximum number that can be formed using 5 units of sand is 99999 where each digit '9' consumed 1 unit of sand.

SAMPLE CASE 3 :
Maximum available sand is 5 units but sand required to form any of the 9 digits ( 1 to 9) is greater than maximum available sand which is 9 units . So its impossible to form any number and you have to print '-1' (without quotes).

NOTE : Ignore '0' digit . You have to form numbers without considering '0' digit.

Solution (in PYTHON):

Solution:
for _ in range(int(raw_input())):
	n = int(raw_input())
	a = map(int,raw_input().split())
	nd = n/min(a)
	if(nd==0):
		print "-1"
		continue
	li = max(a.index(min(a)),(len(a)-1)-a[::-1].index(min(a)))
	i1 = li+1
	left = n%a[li]
	no = []
	j = 8
	while(left>0 and j>li):
		if(a[j]-a[li] > left):
			j-=1
		else:
			no.append(j+1)
			left -= a[j]-a[li]
	
	digits_left = nd - len(no)
	for i in range(digits_left):
		no.append(i1)
		
#	for i in a[8:li:-1]:
	print "".join(map(str,no))