#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1e6+10;
const int INF=0x3f3f3f3f;
const int mod=1000000007;
int ans[100010];
int main()
{
    int T;
    scanf("%d",&T);
    while (T--)
    {
        int n,m,pos=0;
        scanf("%d%d",&n,&m);
        ll MAX=0;
        ll num;
        for (int i=0;i<n;i++)
        {
            scanf("%I64d",&num);
            MAX+=num;
        }
        for (int i=0;i<m;i++)
        {
            scanf("%I64d",&num);
            if (num>MAX)
            ans[pos++]=1;
            else ans[pos++]=0;
        }
        for (int i=0;i<pos;i++)
        printf("%d",ans[i]);
        puts("");
    }
    return 0;
}