#include #define rep(i,n) for(int i=(0);i<(n);i++) using namespace std; typedef long long ll; typedef long double ld; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } ll ceil(ll a, ll b){ return (a + b - 1) / b; } int main(){ cin.tie(0); ios::sync_with_stdio(false); ll n, k, x, y; cin >> n >> k >> x >> y; vector a(n+1, 0); rep(i, n){ cin >> a[i]; a[i]--; a[i] = ceil(a[i], k); } sort(a.begin(), a.end()); ll ans = 0; rep(i, n){ ans += (a[i+1] - a[i]) * min((n - i) * x, y); } cout << ans << endl; }