#include<bits/stdc++.h>usingnamespace std;int d[50000];intmain(){int s, n, m;
cin >> s >> n >> m;int l =1, r = s;for(int i =0; i < n;++i){
cin >> d[i];}sort(d, d + n);while(l != r){int mid = l + r +1>>1;int cnt =0, t =0;int i =0;for(; i < n;++i){if(s - d[i]< mid){break;}if(d[i]- t < mid){++cnt;}else{
t = d[i];}}
cnt += n - i;if(cnt <= m){
l = mid;}else{
r = mid -1;}}
cout << l <<'\n';return0;}