#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
const int M = 10000005;
const long long INF = 1e18;
int arr[2][M];
long long f[2][M], g[M];
long long delivery(int N, int K, int L, int p[]) {
int pos = -1;
for (int i = 0; i < N; ++i) if (p[i] * 2 <= L) pos = i;
int sz[2];
sz[0] = 0;
for (int i = 0; i <= pos; ++i) arr[0][++sz[0]] = p[i] * 2;
sz[1] = 0;
for (int i = N - 1; i > pos; --i) arr[1][++sz[1]] = (L - p[i]) * 2;
for (int i = 0; i < 2; ++i) {
for (int j = 1; j <= sz[i]; ++j) {
if (j < K) f[i][j] = arr[i][j];
else f[i][j] = f[i][j - K] + arr[i][j];
}
}
for (int i = 0; i <= K; ++i) g[i] = INF;
for (int i = sz[0]; i >= 0; --i) {
if (sz[0] - i > K) break;
g[sz[0] - i] = f[0][i];
}
long long res = INF;
res = min(res, f[0][sz[0]] + f[1][sz[1]]);
for (int i = sz[1]; i >= 0; --i) {
if (sz[1] - i > K) break;
res = min(res, g[K - (sz[1] - i)] + f[1][i] + L);
}
return res;
}
