#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FOD(i, a, b) for(int i = (a); i >= (b); i--)
#define file(name) if(fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define el cout << '\n'
#define maxn int(2e3 + 5)
using namespace std;
int n, P, Q, a[maxn];
namespace subtask1 {
bool check() {
return n <= 100;
}
int small[105], big[105];
bool dp[105][105][105];
bool valid(int w) {
memset(dp, 0, sizeof dp);
FOR(i, 1, n) small[i] = big[i] = 0;
int itSmall = 0, itBig = 0;
FOR(i, 1, n) {
while(itSmall + 1 <= n && a[itSmall + 1] - a[i] < w) small[++itSmall] = i;
while(itBig + 1 <= n && a[itBig + 1] - a[i] < (w << 1)) big[++itBig] = i;
}
dp[0][0][0] = 1;
FOR(i, 1, n)
FOR(j, 0, min(i, P))
FOR(k, 0, min(i, Q)) {
if(j >= 1) {
dp[i][j][k] |= dp[i - 1][j - 1][k];
dp[i][j][k] |= dp[small[i]][j][k];
}
if(k >= 1) {
dp[i][j][k] |= dp[i - 1][j][k - 1];
dp[i][j][k] |= dp[big[i]][j][k];
}
}
return dp[n][P][Q];
}
void solve() {
int l = 0, r = 1e9, res = 0;
while(l <= r) {
int mid = (l + r) >> 1;
if(valid(mid)) res = mid, r = mid - 1;
else l = mid + 1;
}
cout << res;
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> P >> Q;
FOR(i, 1, n) cin >> a[i];
if(subtask1::check()) return subtask1::solve(), 0;
return 0;
}
