#include<bits/stdc++.h>
using namespace std;
#define sz(v) (int)((v).size())
using ll=long long;
using i128=__int128_t;
const ll thres=(ll)(1e18)+10;
vector<ll> vC[70007];
inline ll C(int n,int k)
{
	k=min(k,n-k);
	return k>=sz(vC[n])?thres:vC[n][k];
}
inline ll mul(ll a,ll b)
{
	if(1.*a*b>thres) return thres;
	return a*b;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for(int i=0;i<70007;i++)
	{
		vC[i].resize(min(30,i+1));
		vC[i][0]=1;
		for(int j=1;j<sz(vC[i]);j++)
			if(j==i)
				vC[i][j]=1;
			else
				vC[i][j]=min(thres,vC[i-1][j]+vC[i-1][j-1]);
	}
	int q;
	cin>>q;
	while(q--)
	{
		static int c[12];
		for(int i=0;i<10;i++)
			cin>>c[i];
		ll k;
		cin>>k;
		const ll mod=1e9+7;
		ll ans=0;
		int cur2=0;
		int sum=accumulate(c,c+10,0);
		ll ways=thres;
		while(sum--)
		{
			int tmp=sum+1;
			while(!c[cur2]) cur2++;
			int mx=0;
			for(int i=0;i<10;i++)
				mx=max(mx,c[i]);
			if(ways==thres&&sum-mx<=25)
			{
				ways=1;
				for(int i=cur2;i<9;i++)
				{
					ways=mul(ways,C(tmp,c[i]));
					if(ways>=thres) break;
					tmp-=c[i];
				}
			}
			else if(ways==thres)
			{
				c[cur2]--;
				ans=(ans*10+cur2)%mod;
				while(c[cur2]>30)
				{
					c[cur2]--;
					ans=(ans*10+cur2)%mod;
					sum--;
				}
				continue;
			}
			int cur=cur2;
			while(cur<10)
			{
				if(!c[cur])
				{
					cur++;
					continue;
				}
				ll ways2=(ways>=thres?thres:(ways<=1e14?ways*c[cur]/(sum+1):ways/(sum+1)*c[cur]));
				if(ways2<k)
				{
					k-=ways2;
					cur++;
				}
				else
				{
					ways=ways2;
					break;
				}
			}
			ans=(ans*10+cur)%mod;
			c[cur]--;
		}
		cout<<ans<<'\n';
	}
	return 0;
}