// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cassert>
#include <functional>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951ll
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl


int main(void){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N,Q;
    cin >> N >> Q;
    string sN = to_string(N);

    REP(_,Q){

        ll X;
        cin >> X;

        if(X%N==0){
            cout << "Yes" << endl;
            continue;
        }

        string sX = to_string(X);
        if(sX.size() < sN.size()){
            cout << "No" << endl;
            continue;
        }

        ll M = sX.size()-sN.size()+1;

        bool decide = false;
        REP(i,M){
            if(decide)break;
            bool ok = true;
            REP(j,sN.size()){
                if(sX[i+j]!=sN[j]){
                    ok = false;
                    break;
                }
            }
            if(ok){
                decide = true;
            }
        }

        if(decide){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }

    }

    return 0;
    
}