#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long ll;

const int maxn = 100000 + 5;

char s[maxn];

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n, q;
        scanf("%d%d", &n, &q);
        ll sum = 0;
        for(int i = 0; i < n; ++i)
        {
            int x;
            scanf("%d", &x);
            sum += x;
        }
        for(int i = 0; i < q; ++i)
        {
            ll p;
            scanf("%I64d", &p);
            if(p > sum) s[i] = '1';
            else s[i] = '0';
        }
        s[q] = 0;
        puts(s);
    }
    return 0;
}