#include "boxes.h"
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
typedef pair<long long, int> ii;
long long delivery(int N, int K, int L, int p[]) {
queue<ii> dp1, dp2;
long long dptable[N];
dp1.push(ii(0, -1));
for (int i = 0; i < N; ++i) {
while (!dp1.empty() && dp1.front().second + K < i) dp1.pop();
while (!dp2.empty() && dp2.front().second + K < i) dp2.pop();
if (i >= K - 1) dptable[i] = L + dptable[i - K + 1];
if (!dp1.empty()) dptable[i] = min(dptable[i], dp1.front().first + 2 * p[i]);
if (!dp2.empty()) dptable[i] = min(dptable[i], dp2.front().first);
if (i != N - 1) {
while (!dp1.empty() && dp1.back().first >= dptable[i]) dp1.pop();
dp1.push(ii(dptable[i], i));
while (!dp2.empty() && dp2.back().first >= dptable[i] + 2 * (L - p[i + 1])) dp2.pop();
dp2.push(ii(dptable[i] + 2 * (L - p[i + 1]), i));
}
}
return dptable[N - 1];
}
