#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


template <class T> T power(T a, long long e, T m) {
  for (T b = 1; ; (a *= a) %= m) {
    if (e & 1) (b *= a) %= m;
    if (!(e >>= 1)) return b;
  }
}

long long gcd(long long a, long long b) {
  if (a < 0) a = -a;
  if (b < 0) b = -b;
  if (a == 0) return b;
  if (b == 0) return a;
  const int s = __builtin_ctzll(a | b);
  a >>= __builtin_ctzll(a);
  do {
    b >>= __builtin_ctzll(b);
    if (a > b) swap(a, b);
    b -= a;
  } while (b);
  return a << s;
}

bool isPrime(long long n) {
  if (n <= 1 || n % 2 == 0) return (n == 2);
  const int s = __builtin_ctzll(n - 1);
  const long long d = (n - 1) >> s;
  // http://miller-rabin.appspot.com/
  for (const long long base : {2, 325, 9375, 28178, 450775, 9780504, 1795265022}) {
    __int128 a = base % n;
    if (a == 0) continue;
    a = power<__int128>(a, d, n);
    if (a == 1 || a == n - 1) continue;
    bool ok = false;
    for (int i = 0; i < s - 1; ++i) {
      (a *= a) %= n;
      if (a == n - 1) {
        ok = true;
        break;
      }
    }
    if (!ok) return false;
  }
  return true;
}

// n >= 3, odd
void factorizeRec(long long n, vector<long long> &ps) {
  static constexpr int BLOCK = 256;
  if (isPrime(n)) {
    ps.push_back(n);
  } else {
    for (long long c = 2; ; ++c) {
      long long x, y = 2, y0, z = 1, d = 1;
      for (int l = 1; d == 1; l <<= 1) {
        x = y;
        for (int i = 0; i < l; ++i) y = (static_cast<__int128>(y) * y + c) % n;
        for (int i = 0; i < l; i += BLOCK) {
          y0 = y;
          for (int j = 0; j < BLOCK && j < l - i; ++j) {
            y = (static_cast<__int128>(y) * y + c) % n;
            z = (static_cast<__int128>(z) * (y - x)) % n;
          }
          if ((d = gcd(z, n)) != 1) break;
        }
      }
      if (d == n) {
        for (y = y0; ; ) {
          y = (static_cast<__int128>(y) * y + c) % n;
          if ((d = gcd(y - x, n)) != 1) break;
        }
      }
      if (d != n) {
        factorizeRec(d, ps);
        factorizeRec(n / d, ps);
        return;
      }
    }
  }
}

vector<pair<long long, int>> factorize(long long n) {
  vector<pair<long long, int>> pes;
  if (n >= 2) {
    const int s = __builtin_ctzll(n);
    if (s) pes.emplace_back(2, s);
    if (n >> s >= 2) {
      vector<long long> ps;
      factorizeRec(n >> s, ps);
      std::sort(ps.begin(), ps.end());
      const int psLen = ps.size();
      for (int i = 0, j = 0; i < psLen; i = j) {
        for (; j < psLen && ps[i] == ps[j]; ++j) {}
        pes.emplace_back(ps[i], j - i);
      }
    }
  }
  return pes;
}

vector<long long> divisors(long long n) {
  const auto pes = factorize(n);
  vector<long long> ds{1};
  for (const auto &pe : pes) {
    const int len0 = ds.size();
    const int len1 = len0 * (pe.second + 1);
    ds.resize(len1);
    for (int i = len0; i < len1; ++i) ds[i] = ds[i - len0] * pe.first;
  }
  std::sort(ds.begin(), ds.end());
  return ds;
}

////////////////////////////////////////////////////////////////////////////////



constexpr Int INF = 1001001001001001001LL;

int N;
Int S, M;
vector<Int> A;

vector<Int> freq;

int DLen;
vector<Int> D;
vector<vector<pair<int, int>>> E;

Int counter;
Int ans;

void dfs(int i, int j, int f, Int sum, Int cost) {
  if (i == 0) {
    ++counter;
// if(M<=10)cerr<<"  sum = "<<sum<<", cost = "<<cost<<endl;
    if (sum <= S) {
      cost -= freq[0];
      cost += abs((S - sum) - freq[0]);
      chmin(ans, cost);
    }
  } else {
    for (const auto &e : E[i]) if (e.first) {
      // divide by e.first
      const int ii = e.second;
      const int jj = e.first;
      if (j < jj) break;
      const int ff = ((j == jj) ? f : 0) + 1;
      dfs(ii, jj, ff, sum + D[jj], cost + ((ff <= freq[jj]) ? -1 : +1));
    }
  }
}

int main() {
  for (; ~scanf("%d%lld%lld", &N, &S, &M); ) {
    A.resize(N);
    for (int n = 0; n < N; ++n) {
      scanf("%lld", &A[n]);
    }
    
    D = divisors(M);
    DLen = D.size();
    E.assign(DLen, {});
    for (int i = 0; i < DLen; ++i) {
      for (int j = 0; j < DLen; ++j) {
        const int k = lower_bound(D.begin(), D.end(), D[i] * D[j]) - D.begin();
        if (k == DLen) break;
        if (D[k] == D[i] * D[j]) E[k].emplace_back(i, j);
      }
    }
cerr<<"M = "<<M<<", |D| = "<<DLen<<endl;
    
    freq.assign(DLen, 0);
    for (int n = 0; n < N; ++n) {
      const int i = lower_bound(D.begin(), D.end(), A[n]) - D.begin();
      if (i < DLen && D[i] == A[n]) {
        ++freq[i];
      }
    }
    
    counter = 0;
    ans = INF;
    dfs(DLen - 1, DLen - 1, 0, 0LL, N);
cerr<<"counter = "<<counter<<endl;
    printf("%lld\n", (ans < INF) ? ans : -1);
  }
  return 0;
}