//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]==0)continue;
if(p[i]<=(L-p[i]))v.pb(p[i]);
else vv.pb(p[i]);
//~ if(p[i]==0)vv.pb(0);
}
n=N;
k=K;
lo mn=inf;
sort(v.begin(),v.end());
sort(vv.begin(),vv.end());
reverse(v.begin(),v.end());
int bas=0;
int son=0;
cev=0;
for(int i=1;i<=n+1;i++){
if(i!=n+1){
//~ cout<<cev<<endl;
if(i%K==1%K)cev+=L;
if(bas==(lo)v.size())son++;
else if(son==(lo)vv.size())bas++;
else{
bas++;
lo cev1=0;
for(int j=bas;j<(lo)v.size();j++){
if(j%k==bas%k)cev1+=(v[j])*2;
}
for(int j=son;j<(lo)vv.size();j++){
if(j%k==son%k)cev1+=(L-vv[j])*2;
}
bas--;
son++;
lo cev2=0;
for(int j=bas;j<(lo)v.size();j++){
if(j%k==bas%k)cev2+=(v[j])*2;
}
for(int j=son;j<(lo)vv.size();j++){
if(j%k==son%k)cev2+=(L-vv[j])*2;
}
son--;
if(cev1<=cev2)bas++;
else son++;
mn=min(mn,cev1+cev);
mn=min(mn,cev2+cev);
//~ cout<<v[bas]<<" : : "<<son<<" : : "<<cev1<<endl;
continue;
}
}
lo cev1=0;
for(int j=bas;j<(lo)v.size();j++){
if(j%k==bas%k)cev1+=(v[j])*2;
}
for(int j=son;j<(lo)vv.size();j++){
if(j%k==son%k)cev1+=(L-vv[j])*2;
}
mn=min(mn,cev1+cev);
}
bas=0;
son=0;
lo cev1=0;
for(int j=bas;j<(lo)v.size();j++){
if(j%k==bas%k)cev1+=(v[j])*2;
}
for(int j=son;j<(lo)vv.size();j++){
if(j%k==son%k)cev1+=(L-vv[j])*2;
}
//~ cout<<cev1<<"**\n"<<endl;
mn=min(mn,cev1);
return mn;
}
