//qoj362
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N = 1e5 + 10;
int n, k, T, a[N];

bool chk(int val){
    int l = k, r = k, lin = 0, rin = 0, sum = T * val * 2;
    while(l != 1 && r != n){
        int x = a[l] - a[l-1] - lin;
        int y = a[r+1] - a[r] - rin;
        if(min(x, y) > sum) return 0;
        if(x < y){
            lin += a[l] - a[l-1];
            sum = sum + T * val * 2 - x;
            -- l;
        } else {
            rin += a[r+1] - a[r];
            sum = sum + T * val * 2 - y;
            ++ r;
        }
    }
    while(l != 1){
        int x = a[l] - a[l-1] - lin;
        if(x > sum) return 0;
        lin += a[l] - a[l-1];
        sum = sum + T * val * 2 - x;
        -- l;
    }
    while(r != n){
        int y = a[r+1] - a[r] - rin;
        if(y > sum) return 0;
        rin += a[r+1] - a[r];
        sum = sum + T * val * 2 - y;
        ++ r;
    }
    return 1;
}

signed main(){
    scanf("%lld%lld%lld", &n, &k, &T);
    for(int i = 1; i <= n; ++ i){
        scanf("%lld", &a[i]);
    }
    int l = 0, r = 1e9;
    while(l < r){
        int mid = l + r >> 1;
        if(chk(mid)){
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    printf("%lld\n", l);
    return 0;
}