BestCoder Round #86 1001

#include<stdio.h>
//#include<bits/stdc++.h>
#include<string.h>
#include<iostream>
#include<math.h>
#include<sstream>
#include<set>
#include<queue>
#include<map>
#include<vector>
#include<algorithm>
#include<limits.h>
#define inf 0x3fffffff
#define INF 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define ULL unsigned long long
using namespace std;
int  n,m;
long long a[1000005];
long long q,p;
long long b[1000005],e[1000005],c[1000005];
long long sum=0;
int t;
long long MAXN1,MAXN2;
int main()
{
     int t;
     scanf("%d",&t);
     while(t--)
     {
         sum=0;
         scanf("%d%d",&n,&m);
         for(int i=1;i<=n;i++)
         {
           //  cin>>a[i];
             scanf("%lld",&a[i]);
             sum+=a[i];
         }
         for(int i=1;i<=m;i++)
         {
             scanf("%lld",&b[i]);
             if(sum>=b[i])
             {
                printf("0");
             }
             else
             {
                 printf("1");
             }
         }
         puts("");
     }

    return 0;
}