#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=55555;
int l,n,d;
int a[maxn];
bool judge(int mid)
{
int cont=0;
int st=0;
for(int i=0;i<n;i++)
{
if(a[i]-st<mid)
cont++;
else
st=a[i];
}
if(cont>d)
return false;
else
return true;
}
int main()
{
while(scanf("%d %d %d",&l,&n,&d)!=EOF)
{
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
int ans=0;
int ll=0;
int rr=l;
while(ll<=rr)
{
int mid=(ll+rr)/2;
if(judge(mid))
{
ll=mid+1;
ans=mid;
}
else
{
rr=mid-1;
}
}
printf("%d\n",ans);
}
return 0;
}