#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 100005;
long long v[maxn], q[maxn],sum;

int main()
{
    int T,n,m;
    scanf("%d", &T);
    while (T--)
    {
        sum = 0;
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i++)
        {
            scanf("%lld", &v[i]);
            sum += v[i];
        }
        for (int i = 1; i <= m; i++)
        {
            scanf("%lld", &q[i]);
        }
        for (int i = 1; i <= m; i++)
        {
            if (q[i] <= sum)
                printf("0");
            else
                printf("1");
        }
        printf("\n");

    }
}