#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
int n , k , l , a [10000007] , adp [1003][1003] , bdp [1003][1003];
vector < int > aa , bb;
long long dlta ( int x , int y )
{
return min ( abs ( x - y ) , l - abs ( x - y ) );
}
long long af ( int x , int kk )
{
if ( x == aa . size () - 1 ) return dlta ( aa [x] , 0 );
if ( adp [x][kk] != -1 ) return adp [x][kk];
long long ans = 1e18;
if ( kk != k ) ans = min ( ans , af ( x , k ) + 2 * dlta ( aa [x] , 0 ) );
if ( kk ) ans = min ( ans , af ( x + 1 , kk - 1 ) + dlta ( aa [x] , aa [ x + 1 ] ) );
return adp [x][kk] = ans;
}
long long bf ( int x , int kk )
{
if ( x == bb . size () - 1 ) return dlta ( bb [x] , 0 );
if ( bdp [x][kk] != -1 ) return bdp [x][kk];
long long ans = 1e18;
if ( kk != k ) ans = min ( ans , bf ( x , k ) + 2 * dlta ( bb [x] , 0 ) );
if ( kk ) ans = min ( ans , bf ( x + 1 , kk - 1 ) + dlta ( bb [x] , bb [ x + 1 ] ) );
return bdp [x][kk] = ans;
}
long long f ( int x )
{
long long ans = 0 , kk = k;
aa . clear () , bb . clear ();
aa . push_back ( 0 );
bb . push_back ( 0 );
for ( int i = 1 ; i <= x ; i ++ ) aa . push_back ( a [i] );
for ( int i = n ; i > x ; i -- ) bb . push_back ( a [i] );
memset ( adp , -1 , sizeof adp );
memset ( bdp , -1 , sizeof bdp );
ans = af ( 0 , k ) + bf ( 0 , k );
return ans;
}
long long delivery(int N, int K, int L, int p[]) {
n = N , k = K , l = L;
for ( int i = 1 ; i <= n ; i ++ ) a [i] = p [ i - 1 ];
int l = 0 , r = n , mid1 , mid2;
while ( r - l > 100 )
{
mid1 = l + ( r - l ) / 3;
mid2 = r - ( r - l ) / 3;
long long cst1 = f ( mid1 ) , cst2 = f ( mid2 );
if ( cst1 < cst2 ) r = mid2;
else l = mid1;
}
long long ans = 1e18;
for ( int i = l ; i <= r ; i ++ ) ans = min ( ans , f ( i ) );
return ans;
}