#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
#define maxn 200100
int a[maxn];

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        string s="";
        memset(a,0,sizeof(a));
        int n,m;
        cin>>n>>m;
        ll ans=0;
        for(int i=0; i<n; ++i)
        {
            scanf("%d",&a[i]);
            ans+=a[i];
        }
        for(int i=0; i<m; ++i)
        {
            ll p;
            scanf("%I64d",&p);
            if(p>ans) s+="1";
            else s+="0";
        }
        cout<<s<<endl;
    }
    return 0;
}

/**
1
3 3
2 5 4
1
7
10000
**/