#include<stdio.h>
#include<fstream>
#include<algorithm>
using namespace std;
int din[1010100];
int v[1010100];
int D,N,cost;

int main()
{
ifstream fin("zombie.in");
ofstream fout("zombie.out");
    fin>>D>>N>>cost;
   // scanf("%d%d%d",&D,&N,&cost);
    for(int i=1;i<=N;++i)
     fin>>v[i];
    int mij=1;
    for(int i=1;i<=N;++i)
    {
    while(!(v[mij]+D>=v[i]))
    ++mij;
     //  printf("%d\n",caut(v[i],i));
        din[i]=min(din[i-1]+1,din[mij-1]+cost);
        //printf(" %d\n",caut(v[i],i));
    }
    fout<<din[N];

}