#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <string>
#include <map>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <set>
using namespace std;
typedef __int64 LL;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;
void add(LL &x, LL y) { x += y; if(x < 0) x += MOD; x %= MOD; }
LL v[MAXN], p[MAXN];
int main()
{
    int t; scanf("%d", &t);
    while(t--) {
        int n, m; scanf("%d%d", &n, &m);
        LL ans = 0;
        for(int i = 1; i <= n; i++) {
            scanf("%I64d", &p[i]);
            ans += p[i];
        }
        for(int i = 1; i <= m; i++) {
            scanf("%I64d", &v[i]);
        }
        for(int i = 1; i <= m; i++) {
            if(ans < v[i]) {
                printf("1");
            }
            else {
                printf("0");
            }
        }
        printf("\n");
    }
    return 0;
}