#include<bits/stdc++.h>
using namespace std;typedef long long ll;
const int N=70007;const ll p=1145141919810011ll,p2=1e9+7;
int a[11],st,minn;ll pow0[N],pow1[N],ans,m,inv[N],f[N],f_[N];double s[N];
void sol(){
	ans=st=minn=0;for(int i=0;i<10;++i)scanf("%d",&a[i]),st+=a[i];
	scanf("%lld",&m);double qz=0;ll wz;for(int i=0;i<10;++i)qz-=s[a[i]];
	for(int i=0;i<10;++i)if(a[i]&&qz+s[st-a[i]]+s[a[i]]>13){
		ans=(ans*pow0[a[i]]+pow1[a[i]]*i)%p2;
		st-=a[i],qz+=s[a[i]],a[i]=0;
	}
	wz=f[st];for(int i=0;i<10;++i)wz=(__int128)wz*f_[a[i]]%p;
	while(st){
		int fl;
		for(int i=minn;i<10;++i)if(a[i]){
			if(qz>13&&qz+s[st-1]-s[st]+s[a[i]]-s[a[i]-1]>13){fl=i;break;}
			ll q=(__int128)wz*inv[st]%p*a[i]%p;if(m<=q){fl=i;break;}m-=q;
		}
		ans=(ans*10+fl)%p2;qz+=s[st-1]-s[st]+s[a[fl]]-s[a[fl]-1];
		wz=(__int128)wz*inv[st]%p*a[fl]%p;st--;a[fl]--;
		if(!a[minn]){for(int i=0;i<10;++i)if(a[i]){minn=i;break;}}
	}
	printf("%lld\n",ans);return;
}
int main(){
	inv[1]=1;for(int i=2;i<N;++i)inv[i]=(__int128)(p-p/i)*inv[p%i]%p;
	f[0]=f_[0]=pow0[0]=1;for(int i=1;i<N;++i){
		f[i]=(__int128)f[i-1]*i%p,f_[i]=(__int128)f_[i-1]*inv[i]%p;
		s[i]=s[i-1]+log10(i);pow1[i]=(pow1[i-1]*10+1)%p2;
		pow0[i]=pow0[i-1]*10%p2;
	}
	int t;scanf("%d",&t);t=min(t,2000);while(t--)sol();return 0;
}