#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int n;
    cin >> n;
    vector<int> height(n);
    for(int height_i = 0;height_i < n;height_i++){
       cin >> height[height_i];nt t, arr[10], minVal, minVal2, minIndex, minIndex2;
 cin>>t;
 while(t--) {
 minVal=15; minVal2=15; minIndex=-1; minIndex2=-1;
 for(int i=0; i<10; i++) {
 cin>>arr[i];
 if(arr[i]<minVal) {
 minVal=arr[i]; minIndex=i;
 }
 else if(arr[i]<minVal2 && i!=0) {
 minVal2=arr[i]; minIndex2=i;
 }
 }
 if(minIndex!=0) for(;minVal>=0; minVal--) cout<<minIndex;
 else if(minVal==minVal2) for(;minVal2>=0; minVal2--) cout<<minIndex2;
 else {
 cout<<1; for(;minVal>=0; minVal--) cout<<minIndex;
 }
 cout<<endl;
 }
 return 0;
    }
    return 0;
}