#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int N, M;
ll D;
vector<pii> arr;
int ord[202020];
int cnt = 0;
struct segtree {
ll lt[808080], rt[808080], mx[808080], sum[808080];
void update(int v, int st, int ed, int idx, ll val) {
if (st > idx || ed < idx) return;
if (st == ed) {
lt[v] = rt[v] = mx[v] = sum[v] = val;
return;
}
int mid = (st+ed)/2;
update(2*v, st, mid, idx, val);
update(2*v+1, mid+1, ed, idx, val);
lt[v] = max(lt[2*v], lt[2*v+1] + sum[2*v]);
rt[v] = max(rt[2*v+1], rt[2*v] + sum[2*v+1]);
mx[v] = max(mx[2*v], mx[2*v+1]);
mx[v] = max(mx[v], rt[2*v]+lt[2*v+1]);
sum[v] = sum[2*v] + sum[2*v+1];
}
} seg;
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
cin >> N >> M >> D;
for (int i = 1; i <= M; i++) {
int a; cin >> a;
arr.push_back({a, i});
}
sort(arr.begin(), arr.end());
for (int i = 0; i < M; i++) ord[arr[i].second] = i;
set<int> S;
for (int i = 1; i <= M; i++) {
if (!S.empty()) {
auto it = S.lower_bound(ord[i]);
if (it != S.end()) seg.update(1, 1, M, *it, D - (arr[*it].first-arr[ord[i]].first));
if (it == S.begin()) seg.update(1, 1, M, ord[i], 0);
else {
it--;
seg.update(1, 1, M, ord[i], D - (arr[ord[i]].first-arr[*it].first));
}
}
ll ans = seg.mx[1];
if (ans%2) cout << ans/2 << ".5 ";
else cout << ans/2 << " ";
S.insert(ord[i]);
}
return 0;
}
