#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
ll funk(int n,int k,int dis,int arr[],int l,int r){
if(l>r||l<0||r<0||l>=n||r>=n){
return 0;
}
ll ans=INF;
for(int i=l;i<=min(r,l+k-1);i++){
ans=min(ans,arr[i]*2ll+funk(n,k,dis,arr,i+1,r));
}
//cout<<l<<' '<<r<<' '<<ans<<endl;
for(int i=r;i>=max(l,r-k+1);i--){
ans=min(ans,(dis-arr[i])*2ll+funk(n,k,dis,arr,l,i-1));
}
//cout<<l<<' '<<r<<' '<<ans<<endl;
return ans;
}
long long delivery(int n, int k, int l, int arr[]) {
ll ans=0;
if(k==1){
for(int i=0;i<n;i++){
ans+=min(arr[i],l-arr[i])*2;
}
return ans;
}
if(k==n){
sort(arr,arr+n);
ans=min({arr[n-1]*2,(l-arr[0])*2,l});
arr[n]=l;
for(int i=0;i<n;i++){
ans=min(ans,arr[i]*2ll+(l-arr[i+1])*2ll);
}
return ans;
}
sort(arr,arr+n);
ans=funk(n,k,l,arr,0,n-1);
return ans;
}
