#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

void solve() {
	int n, q;
	cin >> n >> q;
	string s = to_string(n);
	int k = s.size();
	auto issubstr = [&](int x) {
		string t = to_string(x);
		rep(i, 0, t.size() - k + 1) {
			if (t.substr(i, k) == s) return 1;
		}
		return 0;
	};
	while (q--) {
		int x;
		cin >> x;
		if (x % n == 0 || issubstr(x)) {
			cout << "Yes\n";
		} else {
			cout << "No\n";
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}