http://codeforces.com/contest/1250/problem/H
#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>
#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int mod=1e9+7;
const int N=5e5+9;
int c[13];
int main()
{
FAST_IO;
int n;
cin>>n;
while(n--)
{
for(int i=0;i<=9;i++) cin>>c[i];
int ans=INF;
for(int i=1;i<=9;i++) ans=min(ans,c[i]+1);
ans=min(ans,c[0]+2);
if(ans==c[0]+2)
{
cout<<'1';
for(int i=0;i<c[0]+1;i++)
{
cout<<'0';
}
cout<<endl;
continue;
}
for(int i=1;i<=9;i++)
{
//cout<<i<<":"<<c[i]<<endl;
if(ans==c[i]+1)
{
for(int j=0;j<c[i]+1;j++) cout<<i;
cout<<endl;
break;
}
}
}
return 0;
}