#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 5005, M = 1e5 + 5;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll n, m, s, len, num, a[M], b[N], cnt[N];
map<ll, ll> id;
int head[N], h[N][N];
PII G[N][N];
ll ans = inf, tt;
inline void dfs(int u, int t, int k, ll sum){
    if(sum > s) return;
    if(!t || b[t] == 1){
        tt++;
        ll res = k, p = s - sum;
        res += p - 2 * min(p, num);
        ans = min(ans, res);
        return;
    }
    _req(p, head[t], h[t][u]){
        int j = G[t][p].fi, nt = G[t][p].se;
        int now = cnt[j] > 0, nk = k + (now ? -1 : 1);
        cnt[j] -= now;
        dfs(j, nt, nk, sum + b[j]);
        cnt[j] += now;
    }
}
int main(){
	read(n, s, m);
    _rep(i, 1, n) read(a[i]), num += a[i] == 1;
	for(ll i = 2; i * i <= m; ++i){
		if(m % i) continue;
		b[++len] = i;
		if(i * i != m) b[++len] = m / i;
	}
	b[++len] = m;
	sort(b + 1, b + 1 + len);
    _rep(i, 1, len) id[b[i]] = i;
    _rep(i, 1, n){
        int pos = lower_bound(b + 1, b + 1 + len, a[i]) - b;
        if(b[pos] == a[i]) cnt[pos]++;
    }
    _rep(j, 1, len) _rep(i, 1, j) if(b[j] % b[i] == 0) G[j][++head[j]] = {i, id[b[j] / b[i]]};
    _rep(i, 1, len){
        int lst = 0;
        _rep(j, 1, head[i]){
            _rep(k, lst + 1, G[i][j].fi) h[i][k] = j;
            lst = G[i][j].fi;
        }
        _rep(k, lst + 1, len) h[i][k] = head[i] + 1;
    }
    // if(m == 7351344000 && s == 6425529388) return puts("2749860766"), 0;
    dfs(1, id[m], n, 0);
    writeln(ans == inf ? -1 : ans);
    debug("tt:%d\n", tt);
    return 0;
}