#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int Nmax = 1e6 + 5;
int v[Nmax];
int n, a, b;
bool ok(int dif)
{
int dr = a, ok = 0;
deque<int>st;
//cout << dif << ": " << '\n';
st.push_front(0);
while(dr <= n && !st.empty())
{
if(dr - st.front() >= a)
{
if(dr - st.front() <= b && v[dr] - v[st.front() + 1] <= dif)
st.push_back(dr), dr ++;
else
st.pop_front();
}
else
dr ++;
}
dr --;
if(st.empty() || st.back() != n)
return false;
return true;
}
int main()
{
int i, st, dr, mid, ans = 0;
cin >> n >> a >> b;
for(i = 1; i <= n; i ++)
cin >> v[i];
sort(v + 1, v + n + 1);
st = 0; dr = v[n] - v[1];
while(st <= dr)
{
mid = (st + dr) / 2;//dif maxima
if(ok(mid))
{
ans = mid;
dr = mid - 1;
}
else
st = mid + 1;
}
cout << ans;
return 0;
}
