#include<bits/stdc++.h>
using namespace std;
int l,n,k,o,s=100000;vector<int>a;
int main(){
cin>>l>>n>>k;
for(int i=0;i<n;i++){cin>>o;a.push_back(o);}
int lx=1,xl=l,mid;
while(lx<=xl){
mid=(lx+xl)/2;int h=0;
for(int i=1;i<(int)a.size();i++)
if(a[i]-a[i-1]>mid)
h+=((a[i]-a[i-1])%mid==0?(a[i]-a[i-1])/mid-1:(a[i]-a[i-1])/mid);
if(h<=k){s=mid;
xl=mid-1;}
if(h>k)lx=mid+1;
}cout<<s;
return 0;
}