#include <bits/stdc++.h>
#include "boxes.h"
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
ll delivery(int N, int K, int L, int pos[]) {
if(K == 1) {
ll ans = 0;
for(int i=0; i<N; i++)
ans += 2 * min(pos[i], L - pos[i]);
return ans;
}
if(K == N) {
sort(pos, pos + N);
ll ans1=0, ans2=0;
//left
int curr = 0;
for(int i=0; i<N; i++) {
ans1 += pos[i] - curr;
curr = pos[i];
}
ans1 += min(curr, L - curr);
curr = L;
for(int i=N-1; i>=0; i--) {
ans2 += curr - pos[i];
curr = pos[i];
}
ans2 += min(curr, L - curr);
return min(ans1, ans2);
}
return 0;
}
