#include<bits/stdc++.h>
using namespace std;
typedef __int128 ull;
bool a[11], b[11];
char s[100010], t[100010];
inline int geta(int u)
{
	int ans = 0;
	for(int i = 0; i < u; i++)
		ans += a[i];
	return ans;
}
inline int getb(int u)
{
	int ans = 0;
	for(int i = 0; i < 10; i++)
		if(b[i])
		{
			if(ans == u)
				return i;
			ans++;
		}
}
signed main()
{
	int T;
	scanf("%d", &T);
	while(T--)
	{
		int n = 0, m = 0;
		for(int i = 0; i < 10; i++)
			scanf("%d", &a[i]), n += a[i];
		for(int i = 0; i < 10; i++)
			scanf("%d", &b[i]), m += b[i];
		scanf("%s", s + 1);
		ull x = 1, pw = 1;
		int len = strlen(s + 1);
		for(int i = 1; i < len; i++)
		{
			x += (i == 1 || !a[0] ? n : n - 1) * pw;
			pw *= n;
		}
		for(int i = 1; i <= len; i++)
		{
			x += (geta(s[i] - '0') - (len != 1 && i == 1 && a[0] ? 1 : 0)) * pw;
			pw /= n;
		}
		pw = 1;
		int p = 1;
		while(true)
		{
			ull cnt = (p == 1 || !b[0] ? m : m - 1) * pw;
			if(x <= cnt)
				break;
			x -= cnt;
			pw *= m, p++;
		}
		for(int i = 1; i <= p; i++)
		{
			t[i] = getb((x - 1) / pw + (p != 1 && i == 1 && b[0] ? 1 : 0)) + '0';
			x = (x - 1) % pw + 1;
			pw /= m;
		}
		t[p + 1] = '\0';
		printf("%s\n", t + 1);
	}
	return 0;
}