#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 0;

#define int ll

int n, s, m;

unordered_map<int, int> mp;
int a[maxn];
int t = 1;
int b[40];
int ans = LLONG_MAX;
int make_cnt = 0;
unordered_map<int, int> mp2;
int c[100005],d[100005];
int q = 0;
void make()
{
	//if(m==9340531200&&s==9340531200)return;
    //make_cnt++;
    int y=0;
    int sp1 = 0;
    int sum = 0;
    fr(i, 1, t) sum += b[i];
    int p = s - sum;

    sp1 += p;
    int p1 = c[1];
    q += min(sp1, p1);
    if(b[t]<=100000)
    {
    	d[b[t]]++;
    	if(d[b[t]]<=c[b[t]]) q++;
	}
	else
	{
		if(mp.count(b[t]))
		{
			q++;
			y=1;
		}
	}
    if (q == 1)
    {
        if (p >= 0)
            ans = min(ans, t + n + p - 2 * q);
    }
    else if (p >= 0)
        ans = min(ans, t + n + p - 2 * q);
    q-=min(sp1, p1);
    if(b[t]<=100000)
    {
		if(d[b[t]]<=c[b[t]]) q--;
    	d[b[t]]--;
	}
	else
	{
		if(y==1)
		{
			q--;
		}
	}
}
int dfs_cnt = 0;
int qsm(int a, int b)
{
    int res = 1;
    while (b)
    {
        if (b & 1)
            res *= a;
        if (res > 1e15)
            return -1;
        a *= a;
        b >>= 1;
    }
    return res;
}
int get(int b, int m)
{
    int l = 2, r = 1e5;
    while (l <= r)
    {
        int mid = l + r >> 1;
        if (qsm(mid, b) <= m && qsm(mid, b) > 0)
        {
            l = mid + 1;
        }
        else
            r = mid - 1;
    }
    return r;
}
vector<int> v;
void dfs(int idx, int m, int sum)
{
    
    if (idx == t)
    {
        b[idx] = m;
        if(b[t]>=b[t-1]) make();
        return;
    }
    int l = b[idx - 1];
    if (idx == 1)
        l = 2;
    int r = get(t - idx + 1, m);

    // cout << "! " << l << " " << r << endl;
    // fr(i, l, r)
    // {
    //     if (m % i == 0)
    //     {
    //         b[idx] = i;
    //         dfs(idx + 1, m / i, sum + i);
    //     }
    // }
    auto it = lower_bound(v.begin(), v.end(), l);
    //auto it = v.begin();
    while (it != v.end() && *it <= r)
    {
		++dfs_cnt;
        if (m % *it != 0)
        {
            it++;
            continue;
        }
        b[idx] = *it;
        d[*it]++;
        if(d[*it]<=c[*it]) q++;
        dfs(idx + 1, m / *it, sum + *it);
        if(d[*it]<=c[*it]) q--;
		d[*it]--;
        it++;
    }
}

void solve()
{
    // cout << (int)(pow(1000000000, 1.0 / 3)) << endl;
    // return;
    cin >> n >> s >> m;
    fr(i, 1, n)
    {
        cin >> a[i];
        if(a[i]<=100000)
        {
        	c[a[i]]++;
		}
		else
		{
			if(m%a[i]==0)
			mp[a[i]]++;
		}
    }
    fr(i, 2, sqrt(m))
    {
        if (m % i == 0)
        {
            v.push_back(i);
        }
    }
    // cout<<sqrt(m)<<endl;
    sort(v.begin(), v.end());
    fr(i, 2, 33)
    {
        t = i;
        dfs(1, m, 0);
    }

    t = 1;
    b[1] = m;
    make();

    // cout << dfs_cnt << endl;
    if (ans == LLONG_MAX)
        ans = -1;
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    //cout<<dfs_cnt;
    return 0;
}

/*
2 9340531200 9340531200
114 514
*/