#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n,m,p;cin >> n >> m >>p;
    ll ans=INF;
    vl a(n);rep(i,n)cin >> a[i];
    sort(all(a));
    ll maxi=a[n-1];
    rep(i,n){
        ll now=a[i];
        if(now>m){
            chmin(ans,1LL);continue;
        }
        ll plus=0;
        ll v=now;
        while(v%p==0){
            v/=p;plus++;
        }
        if(v==1)continue;
        ll x=1,ret=0;
        while(x*maxi<=m){
            x*=v;
            ret+=plus+1;
        }
        ret++;
        chmin(ans,ret);
    }
    if(ans==INF)cout << -1 <<endl;
    else cout << ans <<endl;
}