/*************************************
* author: marvinthang *
* created: 06.03.2023 10:42:04 *
*************************************/
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> scan_op(pair <U, V>) { return in >> u.fi >> u.se; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
// end of template
const long long INF = 1e18;
long long delivery(int N, int K, int L, int p[]) {
long long res = INF;
vector <long long> pref(N + 1), suff(N + 1);
REP(s, N) {
pref[s + 1] = (s < K ? 0 : pref[s + 1 - K]) + p[s] * 2;
suff[s + 1] = (s < K ? 0 : suff[s + 1 - K]) + (L - p[N - s - 1]) * 2;
}
REP(s, N + 1) {
int l = 1, r = (N - s) / K;
auto cost = [&] (int m) {
return 1LL * m * L + pref[s] + suff[N - s - m * K];
};
minimize(res, cost(0));
while (l <= r) {
int m = l + r >> 1;
long long a = cost(m - 1), b = cost(m);
minimize(res, min(a, b));
if (a <= b) r = m - 1; else l = m + 1;
}
// for (int t = s; t <= N; t += K) {
// long long cur = 1LL * (t - s) / K * L;
// cur += pref[s];
// cur += suff[N - t];
// cout << cur << ' ';
// minimize(res, cur);
// }
// cout << '\n';
}
return res;
}
