#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int gcd(int a, int b) {
    while (b != 0) {
        int temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}
int gcd_of_list(const vector<int>& nums) {
    int current_gcd = nums[0];
    for (size_t i = 1; i < nums.size(); ++i) {
        current_gcd = gcd(current_gcd, nums[i]);
        if (current_gcd == 1) return 1;
    }
    return current_gcd;
}
int main() {
    int N, M;
    cin >> N >> M;
    vector<int> a(N);
    vector<int> b(M);
    for (int i = 0; i < N; ++i) {
        cin >> a[i];
        a[i] %= 360;
    }
    for (int i = 0; i < M; ++i) {
        cin >> b[i];
        b[i] %= 360;
    }
    int gcd_a = gcd_of_list(a);
    for (int i = 0; i < M; ++i) {
        if (b[i] % gcd_a == 0) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
}