#include<cstdio>

#include<queue>

#include<cstring>

using namespace std;

queue<int>q;

int n,a[2010],m,dis[50010];

bool inq[50010];

void spfa(int s)

{

    memset(dis+1,0x7f,sizeof(dis));

    q.push(s); inq[s]=1; dis[s]=0;

    while(!q.empty())

      {

        int U=q.front();

        for(int i=2;i<=n;++i)

          if(dis[(U+a[i])%a[1]]>dis[U]+a[i])

            {

              dis[(U+a[i])%a[1]]=dis[U]+a[i];

              if(!inq[(U+a[i])%a[1]])

                {

                  q.push((U+a[i])%a[1]);

                  inq[(U+a[i])%a[1]]=1;

                }

            }

        q.pop(); inq[U]=0;

      }

}

int main(){

//	freopen("b.in","r",stdin);

	scanf("%d",&n);

	for(int i=1;i<=n;++i){

		scanf("%d",&a[i]);

	}

	spfa(0);

	int x;

	scanf("%d",&m);

	for(int i=1;i<=m;++i){

		scanf("%d",&x);

		puts(dis[x%a[1]]<=x ? "YES" : "NO");

	}

	return 0;

}