#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> v;
    for (int i = 1; i * i <= n; i++)
        if (n % i == 0) {
            v.pb(i);
            if (n / i != i)
                v.pb(n / i);
        }
    sort(ALL(v));
    map<int, int> mp;
    int mxs = 0;
    for (int i = 1; i <= m; i++) {
        int x;
        cin >> x;
        mp[x]++;
        mxs = max(mxs, x);
    }
    int mxc = 0;
    for (auto [s, c] : mp)
        mxc = max(mxc, c);
    ll c = 0;
    for (int s : v) {
        // cerr << s << " " << mxs << " " << mxc << endl; 
        if (s >= mxs && n / s >= mxc)
            c++;
    }
    assert(c >= 1);
    cout << (c == 1 ? "YES" : "NO") << "\n";
    
}