#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>

using namespace std;

int gcd(int a, int b){
	if(b == 0) return a;
	else return gcd(b, a % b);
}

int main(void)
{
	int n, k, kut;
	cin>>n>>k;
	int mirko[n];
	int slavko;
	bool op[k];
	int g;
	memset(op, 0, sizeof(op));
	
	for(int i = 0; i < n; i++) cin>>mirko[i];
	for(int j = 0; j < k; j++){ 
		cin>>slavko;
		if(n < 2) {
			if(gcd(mirko[0], slavko) != 1 && (mirko[0] % 60 != 0)) op[j] = true;	
		} else {
			g = gcd(mirko[0], mirko[1]);
			for(int l = 2; l < n-1; l++){
				g = gcd(g, mirko[l]);							
			}
			if((slavko > g) && (gcd(g, slavko) != 1) && ((g % 60) != 0)) op[j] = true;
		}
	}	
	for(int i = 0; i < k; i++)
		if(op[i]) cout<<"DA"<<endl;
		else cout<<"NE"<<endl;
	
	return 0;
}