#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pl = array<ll, 2>;
constexpr ll INF = 1e18;

int main() {
    cin.tie(0)->sync_with_stdio(false);
    vector<ll> d;
    ll n, s, m;
    cin >> n >> s >> m;
    for (ll i = 1; i * i <= m; ++i) {
        if (m % i == 0) {
            d.push_back(i);
            if (m / i != i)d.push_back(m / i);
        }
    }
    sort(d.begin(), d.end());
    map<ll, ll> who;
    ll k = d.size();
    vector<vector<array<int,2>>> all(k);
    for (int i = 0; i < k; ++i) {
        who[d[i]] = i;
        for (int j = 0; j <= i; ++j) {
            if (d[i] % d[j] == 0) {
                all[i].push_back({j, -1});
            }
        }
        ll ptr = k - 1;
        for (auto &[x, id]: all[i]) {
            while (d[ptr] > d[i] / d[x]) {
                --ptr;
            }
            id = ptr;
        }
    }
    vector<ll> cnt(k);
    for (ll i = 0; i < n; ++i) {
        ll x;
        cin >> x;
        if (who.count(x))cnt[who[x]]++;
    }
    ll res = INF;
    auto gen = [&](auto &&gen, int now, int last,ll sum, int cost, int total) -> void {
        if (sum > s)return;
        if (!now) {
            ll need = s - sum;
            ll mn = min(cnt[0], need);
            need -= mn;
            total -= mn;
            res=min(res,cost + need + total);
            return;
        }
        if(sum + d[now] <= s){
            ll need = s - sum - d[now];
            ll mn = min(cnt[0],need);
            ll diff = cnt[0] - mn;
            need -= mn;
            ll ttotal = total - mn;
            ll best = cost + need + ttotal;
            if(best - diff - 40 >= res)return;
        }
        for (auto &[x, id]: views::reverse(all[now])) {
            if (x < last)break;
            bool have = cnt[x];
            if (have){
                --cnt[x];
                --total;
            }
            else ++cost;
            gen(gen, id, x, sum + d[x], cost, total);
            if (have){
                ++cnt[x];
                ++total;
            }
            else --cost;
        }
    };
    gen(gen, k - 1, 1, 0, 0, n);
    cout << (res<INF?res:-1) << "\n";
}