#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;
int b[40];
int ans = LLONG_MAX;
int make_cnt = 0;

void make()
{
    make_cnt++;
    map<int, int> mp2;
    auto print = [&]()
    {
        cout << t << " ";
        fr(i, 1, t) cout << b[i] << " ";
        cout << endl;
    };
    // print();
    for (int i = 1; i <= t; i++)
    {
        mp2[b[i]]++;
    }
    int q = 0;
    int sum = 0;
    fr(i, 1, t) sum += b[i];
    int p = s - sum;

    mp2[1] += p;
    int p1 = mp[1];
    q += min(mp2[1], p1);
    for (auto [k, v] : mp2)
    {
        if (k == 1)
            continue;
        q += min(v, mp[k]);
    }
    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);
    // if (t + n - 2 * q == 4)
    // {
    //     cout << p << endl;
    //     print();
    // }
}
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;
}
void dfs(int idx, int m)
{
    ++dfs_cnt;
    // cout << dfs_cnt << endl;
    if (idx == t)
    {
        b[idx] = m;
        make();
        return;
    }
    int l = b[idx - 1];
    if (idx == 1)
        l = 2;
    int r = 1e9;

    // cout << "! " << l << " " << r << endl;
    fr(i, l, r)
    {
        if (qsm(i, t - idx + 1) > m || qsm(i, t - idx + 1) < 0)
            break;
        if (m % i == 0)
        {
            b[idx] = i;
            dfs(idx + 1, m / i);
        }
    }
}

void solve()
{
    // cout << (int)(pow(1000000000, 1.0 / 3)) << endl;
    // return;
    cin >> n >> s >> m;
    fr(i, 1, n)
    {
        cin >> a[i];
        mp[a[i]]++;
    }
    fr(i, 2, 33)
    {
        t = i;
        dfs(1, m);
    }

    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();
    return 0;
}