tjut 4696

#include <iostream>
#include <cstdio>  
#include <string>  
#include <string.h>  
#include <map>  
#include <vector>  
#include <cstdlib>  
#include <cmath>  
#include <algorithm>  
#include <stack>  
using namespace std;  
int t[100005];  
int c[100005];  
int m;  
int main()  
{  
    int n ,q;  
    while(scanf("%d%d",&n,&q)!=EOF)  
    {  
        for(int i=1;i<=n;i++)  
        scanf("%d",&t[i]);  
        int ff=0;  
        for(int i=1;i<=n;i++)  
        {  
            scanf("%d",&c[i]);  
            if(c[i]==1)ff=1;  
        }  
        while(q--)  
        {  
            scanf("%d",&m);  
            if(m<=0)printf("NO\n");  
            else  
            {  
                if(ff)printf("YES\n");  
                else  
                {  
                    if(m%2==0)printf("YES\n");  
                    else  
                    printf("NO\n");  
                }  
            }  
        }  
    }  
    return 0;  
}