#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll f(ll s, ll e, ll sz, ll d) {
    return (d * (sz - 1) - (e - s)) / 2;
}

ll solve(ll n, ll d, vector<ll> v) {
    d *= 2;
    for (ll& i : v) i *= 2;
    sort(v.begin(), v.end());
    stack<ll> s, e, sz;
    for (int i = 0; i < n; ++i) {
        ll a = v[i], b = v[i], cnt = 1ll;
        while (!s.empty()) {
            ll add = f(s.top(), e.top(), sz.top(), d), neg = f(a, b, cnt, d);
            if (e.top() + add + d <= a - neg) break;
            a = s.top();
            cnt += sz.top();
            s.pop(); e.pop(); sz.pop();
        }
        s.push(a); e.push(b); sz.push(cnt);
    }
    ll ans = 0;
    while (!s.empty()) {
        ans = max(ans, f(s.top(), e.top(), sz.top(), d));
        s.pop(); e.pop(); sz.pop();
    }
    return ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll n, q, d; cin >> n >> q >> d;
    vector<ll> v(n);
    //for (ll& i : v) cin >> i;
    for (int i = 0; i < n; ++i) v[i] = i;
    while (q--) {
        ll x; cin >> x;
        v.push_back(x);
        ll ans = solve(v.size(), d, v);
        cout << ans / 2;
        if (ans & 1) cout << ".5";
        cout << ' ';
    }
}