#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
using ll = long long ;

cs int N = 3e5 + 5; 

int n, W, E, op; 
ll a[N];
ll ans = 1e18; 

void cmn(ll & x, ll y) {
    if(x > y) x = y; 
}

void work(int zero, int las, int e, int w) {

    // [1, zero)  [zero , n ] 
    ll sum = 0; 
    if(zero > 1) {
        sum += -2ll * a[1];
        w -= 1; 
    }
    if(las != n) {
        sum += 2ll * (a[n] - a[las]);
        w -= 1; 
    }
    sum += a[las]; 
    if(w < 0) return; 
    e -= 1;
    if(las > zero) e -= 1; 
    if(e < 0) return;
    if(las == zero) {
        cmn(ans, sum);
        return;
    }
    multiset <ll> s; 
    for(int i = zero; i + 1 < las; i++) {
        s.insert(a[i + 1] - a[i]);
    }
    e -= s.size();
    while (e < 0) sum += *(s.begin()) * 2, ++ e, s.erase(s.begin());
    cmn(ans, sum);
}
void work1(int zero, int las, int E, int W) {
    if(W == 1) cmn(ans, a[n] + a[n] - a[1] + a[las] - a[1]);
}

int root; 
namespace sgt {
#define mid ((l + r) >> 1)
cs int N = :: N * 32;
ll sum[N]; 
int lc[N], rc[N], sz[N], nd;
void clr() {
    memset(lc, 0, (nd + 1) << 2);
    memset(rc, 0, (nd + 1) << 2);
    memset(sum, 0, (nd + 1) << 3);
    memset(sz, 0, (nd + 1) << 2);
    nd = 0; 
}
void ins(int &x, int l, int r, int c) {
    if(x == 0) x = ++ nd; 
    sz[x] += 1, sum[x] += c; 
    if(l == r) return ;
    if(c <= mid) ins(lc[x], l, mid, c);
    else ins(rc[x], mid + 1, r, c);
}
ll qry(int x, int l, int r, int k) {
    if(l == r) return 1ll * k * l; 
    if(k <= sz[lc[x]]) return qry(lc[x], l, mid, k);
    return qry(rc[x], mid + 1, r, k - sz[lc[x]]) + sum[lc[x]]; 
}
#undef mid
}
void rev(int & las) {
    for(int i = 1; i <= n; i++) a[i] *= -1; 
    swap(E, W);
    las = a[n];
}

void work2(int zero, int las, int e, int w) {

    // [1, zero)  [zero , n ] 
    ll sum = 0; 
    if(zero > 1) {
        sum += -2ll * a[1];
        w -= 1; 
    }
    if(las != n) {
        sum += 2ll * (a[n] - a[las]);
        w -= 1; 
    }
    sum += a[las]; 
    if(w < 0) return; 
    e -= 1;
    if(las > zero) e -= 1; 
    if(e < 0) return;
    if(las == zero) {
        cmn(ans, sum);
        return;
    }
    e -= sgt :: sz[root];
    sum += 2ll * sgt :: qry(root, 0, 1e9, -e);
    cmn(ans, sum);
}
int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);
    cin >> n >> W >> op;
    E = n - W; 
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    int las = a[n];
    if(a[n] < 0) {
        rev(las);
    }
    sort(a + 1, a + n + 1);
    a[n + 1] = 1e9 + 7; 
    las = lower_bound(a + 1, a + n + 1, las) - a;
    int zero = lower_bound(a + 1, a + n + 2, 0) - a; 
    // [1, zero)  [zero , n ] 
    if(op == 1) {
        for(int las = zero; las <= n; las ++) {
            // a[las - 2] -- a[las - 1]
            if(las - 2 >= zero) {
                sgt :: ins(root, 0, 1e9, a[las - 1] - a[las - 2]);
            }
            work2(zero, las, E, W);
        }

        rev(las);
        sort(a + 1, a + n + 1);
        a[n + 1] = 1e9 + 7; 
        las = lower_bound(a + 1, a + n + 1, las) - a;
        zero = lower_bound(a + 1, a + n + 2, 0) - a; 

        sgt :: clr();
        root = 0; 
        for(int las = zero; las <= n; las ++) {
            // a[las - 2] -- a[las - 1]
            if(las - 2 >= zero) {
                sgt :: ins(root, 0, 1e9, a[las - 1] - a[las - 2]);
            }
            work2(zero, las, E, W);
        }
        cout << ans << '\n';

        return 0; 
    }
    else {
        work1(zero, las, E, W);
        work(zero, las, E, W);
        cout << ans << '\n';
    }
    return 0; 
}