#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000


int main(){

	long long N,M,P;
	cin>>N>>M>>P;
	
	long long ans = 0;
	vector<long long> A(N),B(N,0);
	long long maxi = 0LL;
	vector<long long> mul(31,0LL);
	rep(i,N){
		cin>>A[i];
		maxi = max(maxi,A[i]);
		while(A[i]%P==0){
			A[i]/=P;
			B[i]++;
		}
		mul[B[i]] = max(mul[B[i]],A[i]);
	}

	
	vector<long long> dp(1000,0LL);
	dp[0] = 1;
	
	rep(i,31){
		if(mul[i]==0)continue;
		//cout<<i<<','<<mul[i]<<endl;
		vector<long long> ndp(1000,0LL);
		
		rep(j,1000){
			if(dp[j]==0)continue;
			ndp[j] = max(ndp[j],dp[j]);
			if(j+i+1<1000){
				ndp[j+i+1] = max(ndp[j+i+1],ndp[j] * mul[i]);
				ndp[j+i+1] = min(ndp[j+i+1],1000000001LL);
			}
		}
		swap(dp,ndp);
	}
	
	rep(i,dp.size()){
	//	cout<<dp[i]<<endl;
		if(dp[i]*maxi>M){
			cout<<i+1<<endl;
			return 0;
		}
	}
	
	cout<<-1<<endl;
	
    return 0;
}