#include <bits/stdc++.h>
using namespace std;
int main() {
int B,P,D,N;
cin >> B >> P >> D >> N;
vector<int> places(N+2);
places[0] = 0, places.back() = B;
for (int i = 0; i < N; i++)
cin >> places[i+1];
vector<int> dp(N+1);
for (int i = N;i >= 0; i--) {
int cost = (places[i+1]-places[i]-1)/P * D + places[i+1]-places[i];
int time = places[i+1] - places[i];
int minCost = INT_MAX;
for (int j = i+1; j < N+1; j++) {
minCost = min(minCost,dp[j] + cost + (P-time%P)%P);
if (places[j+1] - places[j] <= (P-time%P)%P)
cost += places[j+1] - places[j];
else {
int extraTime = (P-time%P)%P;
cost += D + (places[j+1]-places[j]-extraTime-1)/P * D + places[j+1] - places[j];
}
time += places[j+1]-places[j];
}
dp[i] = min(minCost,cost);
}
cout << dp.front();
}
