#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
int n;
vector<int> v;
vector<vector<vector<int>>> dp;
int f(int pos,int p,int q,int w){
if(p < 0 || q < 0) return false;
if(pos >= n) return true;
if(dp[pos][p][q] != -1) return dp[pos][p][q];
int a = lower_bound(all(v),v[pos] + w) - v.begin();
int b = lower_bound(all(v),v[pos] + 2*w) - v.begin();
dp[pos][p][q] = (f(a,p-1,q,w) || f(b,p,q-1,w));
return dp[pos][p][q];
}
void solve(){
int p,q;
cin >> n >> p >> q;
v.assign(n,0);
for(int i=0;i<n;i++){
cin >> v[i];
}
if(p + q >= n){
cout << 1 << endl;
return;
}
auto check = [&](int m){
dp.assign(n,vector<vector<int>>(p+1,vector<int>(q+1,-1)));
return f(0,p,q,m);
};
sort(all(v));
int l = 1,r = 1e9;
while(l < r){
int m = (l + r) / 2;
if(check(m)) r = m;
else l = m + 1;
}
cout << l << endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--)
solve();
return 0;
}
