#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int n, k, a, b;
vector< int > kutevi;
bool used[ 400 ], novo;
char odgovor[][ 11 ] = { "NE\n", "DA\n" };

int main(void) {

	scanf( "%d%d", &n, &k );
	for( int i = 0; i < n; ++i ) {
		scanf( "%d", &a );
		kutevi.push_back( a % 360 );
		used[ a % 360 ] = true;
	}
	
	novo = 1;
	while( novo ) {
		novo = 0;
		for( int i = 0; i < kutevi.size(); ++i ) {
			for( int j = 0; j < kutevi.size(); ++j ) {
				int kut = ( kutevi[ i ] + kutevi[ j ] ) % 360;
				if( !used[ kut ] ) {
					novo = 1; used[ kut ] = 1;
					kutevi.push_back( kut );
				}
			}
		}
	}
	
	for( int i = 0; i < k; ++i ) {
		scanf( "%d", &b );
		printf( "%s", odgovor[ used[ b % 360 ] ] );
	}

    return 0;

}