#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


int T,n,m;
LL x,sum;

int main()

{
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d%d",&n,&m);
        sum=0;
        for (int i=1;i<=n;++i)
        {
            scanf("%I64d",&x);
            sum+=x;
        }
        for (int i=1;i<=m;++i)
        {
            scanf("%I64d",&x);
            if (x>sum) printf("1");
            else printf("0");
        }
        printf("\n");
    }

    return 0;

}