#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

ULL N,M,P;
ULL maxA,maxB;
pair<ULL,ULL> A[200000];

int main(){
	scanf("%llu%llu%llu",&N,&M,&P);
	maxA=1; maxB=1;
	rep(i,N){
		ULL a; scanf("%llu",&a);
		maxA=max(maxA,a);
		int p=1;
		while(a%P==0){ a/=P; p++; }
		A[i]={a,p};
		maxB=max(maxB,a);
	}
	ULL x=1;
	if(maxA>M){ printf("1\n"); return 0; }
	if(maxB==1){ printf("-1\n"); return 0; }
	ULL ans=1000000;
	M=(M-1)/maxA+1;
	rep(i,N){
		if(A[i].first==1) continue;
		ULL x=1, tmp=1;
		while(x<=M){ x*=A[i].first; tmp+=A[i].second; }
		ans=min(ans,tmp);
	}
	printf("%llu\n",ans);
	return 0;
}