#include using namespace std; typedef long long ll; typedef long double ld; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REPR(i, n) for (int i = n - 1; i >= 0; --i) #define FOR(i, m, n) for (int i = m; i < n; ++i) #define FORR(i, m, n) for (int i = m; i >= n; --i) #define ALL(v) (v).begin(),(v).end() #define ALLR(v) (v).rbegin(),(v).rend() #define fi first #define se second #define PB push_back #define EB emplace_back using P = pair; template using PQ = priority_queue; template using QP = priority_queue,greater>; templatevoid debug(const T &v,ll h,ll w){for(ll i=0;ivoid debug(const T &v,ll n){for(ll i=0;ivoid debug(const vector&v){debug(v,v.size());} templatevoid debug(const vector>&v){for(auto &vv:v)debug(vv,vv.size());} templatevoid debug(stack st){while(!st.empty()){cout<void debug(queue st){while(!st.empty()){cout<void debug(deque st){while(!st.empty()){cout<void debug(PQ st){while(!st.empty()){cout<void debug(QP st){while(!st.empty()){cout<void debug(const set&v){for(auto z:v)cout<void debug(const multiset&v){for(auto z:v)cout<void debug(const array &a){for(auto z:a)cout<void debug(const map&v){for(auto z:v)cout<<"["<bool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> n >> m >> p; vector a(n),c(60,-1); ll mx=0; REP(i,n){ cin >> a[i]; chmax(mx,a[i]); ll num=a[i]; int cnt=1; while(num%p==0){ num/=p; cnt++; } chmax(c[cnt],num); } m=(m+mx-1)/mx; vector dp(1000,1); REP(i,1000){ REP(j,60){ if(c[j]!=-1){ if(dp[i]>INF/c[j]){ dp[i+j]=INF; } else{ if(i+j<1000) chmax(dp[i+j],dp[i]*c[j]); } } } } ll ans=INF; REP(i,1000){ if(dp[i]>=m) chmin(ans,(ll)i+1); } cout << (ans==INF?-1:ans) << endl; // if(ans!=INF) REP(i,ans+1) cerr << i << " " << dp[i] << endl; }