//editor: Jan Tang
//problem:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
using namespace std;
#define set0(a) memset(a,0,sizeof(a));
#define CIN(a,n) for(int i=1;i<=n;i++) cin>>a[i];
typedef long long ll;
typedef unsigned long long ull;
const int Mod = 1e9+7;
const int maxn = 100005;
const int inf = 0x3f3f3f3f;
int m,n;
int a[maxn];
ll b[maxn];
/*==============================head==========================*/
int main(){
    int T; cin >> T; 
    while(T -- > 0){
        scanf("%d%d", &n, &m);
        ll sum = 0;
        for(int i = 1; i <= n; i ++){
            scanf("%d", &a[i]);
            sum += a[i];
        }
        for(int i = 1; i <= m; i++){
            scanf("%lld", &b[i]);
        }
        for(int i = 1; i <= m ; i ++){
            if(sum >= b[i]) printf("0");
            else printf("1");
        }
        printf("\n");
    }
    return 0;
}