#include "boxes.h"
#include <stdio.h>
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
long long sum = 0;
if (K == N) {
if (p[0] > L / 2) sum = (L - p[0])*2;
else if(p[N-1]<=L/2) {
sum = p[N - 1] * 2;
}
else {
sum = L;
}
}
else {
for (int i = 0; i < N; i++)
{
int dist = p[i];
if (p[i] > L / 2) {
dist = L - p[i];
}
sum += dist * 2;
}
}
return sum;
}
