#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll n, k, x, y;std::cin >> n >> k >> x >> y;
  ll al = 1;
  multiset<ll> st;
  re(i, n){
    ll t;std::cin >> t;
    if(t!=1) st.insert(t);
  }
  ll ans = 0;
  while(!st.empty()){
    while(!st.empty()&&(*st.begin())<=al) st.erase(st.begin());
    if(st.empty()) break;
    ll z = st.size();
    ll top = *st.begin() - al;
    ll tm = top/k + (top%k?1:0);

    if(z*x>=y){
      ans += y * tm;
      al += k * tm;
    }else{
      ans += x * tm;
      st.erase(st.begin());
    }
  }
  std::cout << ans << '\n';
}