//Bismillahirrahmanirrahim
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
lo cev;
vector<lo> v,vv;
long long delivery(int N, int K, int L, int p[]) {
//~ cout<<"**\n";
for(int i=0;i<N;i++){
if(p[i]<L/2)v.pb(p[i]);
else vv.pb(p[i]);
}
n=N;
k=K;
lo mn=inf;
sort(v.begin(),v.end());
sort(vv.begin(),vv.end());
reverse(vv.begin(),vv.end());
cev=0;
for(int i=0;i<(int)v.size();i++){
cev+=v[i]*2;
lo cev1=cev;
for(int j=0;j<(int)vv.size();j++){
cev1+=(L-vv[j])*2;
mn=min(mn,cev1+((lo)vv.size()-j-1+((lo)v.size()-i-1)+K-1)/K*L);
if(j%K!=K-1)cev1-=(L-vv[j])*2;
}
mn=min(mn,cev1+((lo)vv.size()+((lo)v.size()-i-1)+K-1)/K*L);
if(i%K!=K-1)cev-=v[i]*2;
}
swap(v,vv);
cev=0;
for(int i=0;i<(int)v.size();i++){
cev+=(L-v[i])*2;
lo cev1=cev;
for(int j=0;j<(int)vv.size();j++){
cev1+=vv[j]*2;
mn=min(mn,cev1+((lo)vv.size()-j-1+((lo)v.size()-i-1)+K-1)/K*L);
if(j%K!=k-1)cev1-=vv[j]*2;
}
mn=min(mn,cev1+((lo)vv.size()+((lo)v.size()-i-1)+K-1)/K*L);
if(i%K!=K-1)cev-=(L-v[i])*2;
}
mn=min(mn,((lo)vv.size()+((lo)v.size())+K-1)/K*L);
return mn;
}
