#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
using namespace std;
int a[100005], b[100000];
int main()
{
    int n, m, t, mi;
    long long sum, q;
    scanf("%d", &t);
    while(t--)
    {
        sum = 0;
        mi = 9999999;
        scanf("%d%d", &n, &m);
        for(int i = 0; i < n; i++)
        {
            scanf("%d", &a[i]);
            sum += a[i];
            if(a[i] < m)
                mi = a[i];
        }
        for(int i = 0; i < m; i++)
        {
            scanf("%I64d", &q);
            if(q > sum)
            {
                b[i] = 1;
            }
            else
                b[i] = 0;
        }
        for(int i = 0; i < m; i++)
        {
            cout << b[i];
        }
        cout <<endl;
    }
    return 0;
}