#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using vi = vector <int>;

const int MAX_N = 4e5 + 5;
const int INF32 = 0x3f3f3f3f;
const ll INF64 = 1e18;

int N, m, idx1[MAX_N], idx2[MAX_N], cnt[MAX_N], tot;
ll S, M, a[MAX_N], fac[MAX_N];
vi f[MAX_N], sz[MAX_N], pt[MAX_N];
bitset <MAX_N / 2> vis[1 << 13];

#define idx(i) ((i) <= m ? idx1[i] : idx2[M / (i)])

// f[i] -> f[j], object with weight w and volume v
void dp(int i, int j, int w, int v) {
    for (auto x : pt[i]) {
        int v_ = v + x;
        if (!vis[j].test(v_)) {
            vis[j].set(v_);
            pt[j].push_back(v_);
        }
        f[j][v_] = min(f[j][v_], f[i][x] + w);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    cin >> N >> S >> M;
    m = sqrt(M);
    for (int i = 1; i <= m; i ++) {
        if (M % i == 0) {
            idx1[i] = ++ tot;
            fac[tot] = i;
        }
    }
    for (int i = m - (1ll * m * m == M); i > 0; i --) {
        if (M % i == 0) {
            idx2[i] = ++ tot;
            fac[tot] = M / i;
        }
    }
    for (int i = 1; i <= N; i ++) {
        cin >> a[i];
        if (M % a[i] == 0) cnt[idx(a[i])] ++;
    }
    int K = N - cnt[1];
    
    for (int i = 1; i <= tot; i ++) {
        sz[i].resize(tot);
    }
    int n = 0;
    for (int &i = n = 2; i <= tot && fac[i] <= m; i ++) {
        for (int j = 1; j <= tot; j ++) {
            sz[i][j] = sz[i - 1][j];
        }
        for (int j = tot; j >= i; j --) {
            ll tmp = fac[j];
            while (tmp % fac[i] == 0) {
                tmp /= fac[i];
                sz[i][j] = max(sz[i][j], sz[i][idx(tmp)] + (int)fac[i]);
            }
        }
    }
    for (int i = 1; i <= tot; i ++) {
        f[i].resize(sz[n - 1][i] + 1);
        for (auto &x : f[i]) x = INF32;
    }
    
    f[1][0] = 0;
    pt[1].push_back(0);
    for (int i = 2; i < n; i ++) {
        for (int j = tot; j >= i; j --) {
            if (fac[j] % fac[i]) continue;
            ll tmp = fac[j]; int sum = 0;
            for (int k = 1; tmp % fac[i] == 0; k ++) {
                tmp /= fac[i]; sum += fac[i];
                dp(idx(tmp), j, k <= cnt[i] ? -k : k - (cnt[i] << 1), sum);
            }
        }
    }
    ll ans = INF64;
    for (int i = tot; i >= n; i --) {
        for (int j = sz[n - 1][idx(M / fac[i])]; j >= 0; j --) {
            ll v = j + fac[i];
            ll f_ = f[idx(M / fac[i])][j];
            if (f_ == INF32) f_ = INF64 * 2;
            ll g = f_ + (cnt[i] ? -1 : 1);
            if (v <= S) {
                ans = min(ans, K + g + abs(S - v - N + K));
            }
        }
    }
    assert(idx(M) == tot);
    for (int i = sz[n - 1][tot]; i >= 0; i --) {
        int v = i;
        ll g = f[tot][i];
        if (g == INF32) g = INF64 * 2;
        if (v <= S) {
            ans = min(ans, K + g + abs(S - v - N + K));
        }
    }
    if (ans < INF64) {
        cout << ans << endl;
    }else {
        cout << "-1\n";
    }
    
    return 0;
}