#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;
#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);
ll delivery(int n, int k, int l, int p[]) {
assert(n <= 10);
vector<int> a(n);
REP(i, 0, n) a[i] = p[i];
sort(all(a));
auto dist = [&](int u, int v) -> int {
return min(abs(u - v), l - abs(u - v));
};
auto work = [&]() -> ll {
int prev = 0;
int cnt = 0;
ll ans = 0;
REP(i, 0, n) {
ans += dist(a[i], prev);
prev = a[i];
cnt++;
if (cnt == k) {
prev = 0;
cnt = 0;
ans += dist(a[i], 0);
}
}
if (cnt) {
ans += dist(prev, 0);
}
return ans;
};
ll ans = LONG_LONG_MAX;
do {
ans = min(ans, work());
} while (next_permutation(all(a)));
return ans;
}
// signed main() {
// int n, k, l; cin >> n >> k >> l;
// int p[n];
// REP(i, 0, n) cin >> p[i];
// cout << delivery(n, k, l, p) << endl;
// }
