ll@n,@m,@(l,r)[n+m],@k;
sortA(n,l,r);
sortA(m,l+n,r+n);
rep(i,n+m-1){
	if(i!=n-1&&r[i]>=l[i+1]){
		rep(k) wtSp('1');
		exit(0);
	}
}
rep(k){
	ll@p;
	rep(i,n,n+m){
		ll j=bsearch_max[ll,j,-1,n-1](l[j]<=2p-l[i]);
		if(j>=0&&r[j]>=2p-r[i]){
			wtSp('1');
			goto next;
		}
	}
	wtSp('0');
	next:;
}