#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ld EPS=1e-12;
const ll INF=1e9+7;
const int LIM=1e5+7;
ll T[LIM], n, k, t;
bool check(ll s) {
	vector<ld>A, B;
	A.pb(t);
	for(int i=k; i<n-1; ++i) {
		A.pb(-(ld)T[i]/(ld)(2*s));
		A.pb(t);
	}
	for(int i=k-1; i>=0; --i) {
		B.pb(-(ld)T[i]/(ld)(2*s));
		B.pb(t);
	}
	int la=0, lb=0, akta=0, aktb=0;
	ld sum=0, suma=0, sumb=0;
	while(la<A.size() || lb<B.size()) {
		bool ok=false;
		while(akta<A.size() && suma+A[akta]+sum>-EPS) {
			ok=true;
			suma+=A[akta];
			if(suma>-EPS) {
				sum+=suma;
				suma=0;
				la=akta+1;
			}
			++akta;
		}
		while(aktb<B.size() && sumb+B[aktb]+sum>-EPS) {
			ok=true;
			sumb+=B[aktb];
			if(sumb>-EPS) {
				sum+=sumb;
				sumb=0;
				lb=aktb+1;
			}
			++aktb;
		}
		if(!ok) break;
	}
	if(akta<A.size() || aktb<B.size()) return false;
	return suma+sumb+sum>-EPS;
}
ll solve(vector<ll>P) {
	rep(i, n-1) T[i]=P[i+1]-P[i];
	ll po=0, ko=INF;
	while(po<ko) {
		ll sr=(po+ko)/2;
		if(check(sr)) ko=sr; else po=sr+1;
	}
	return po;
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n >> k >> t; --k;
	vector<ll>P(n);
	rep(i, n) cin >> P[i];
	ll ans=solve(P);
	rep(i, n) P[i]=P[n-1]-P[i];
	reverse(all(P));
	k=n-k-1;
	ans=min(ans, solve(P));
	cout << ans << '\n';
}