#include <stdio.h>
#define N 200000
#define M 200000
#define N_ (1 << 19) /* N_ = pow2(ceil(log2(N + M))) */
#define INF 0x3f3f3f3f3f3f3f3fLL
long long max(long long a, long long b) { return a > b ? a : b; }
unsigned int X = 12345;
int rand_() {
return (X *= 3) >> 1;
}
int xx[N + M], idx[N + M], n, m, d;
void sort(int *ii, int l, int r) {
while (l < r) {
int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;
while (j < k)
if (xx[ii[j]] == xx[i_])
j++;
else if (xx[ii[j]] < xx[i_]) {
tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
i++, j++;
} else {
k--;
tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
}
sort(ii, l, i);
l = k;
}
}
long long st[N_ * 2], pp[N_ * 2], qq[N_ * 2]; int sz[N_ * 2], n_;
void build() {
int i;
n_ = 1;
while (n_ < n + m)
n_ <<= 1;
for (i = 0; i < n_ * 2; i++)
st[i] = -INF, pp[i] = -INF, qq[i] = -INF;
}
void pul(int i) {
int l = i << 1, r = l | 1;
sz[i] = sz[l] + sz[r];
pp[i] = max(pp[l], pp[r] + (long long) sz[l] * d);
qq[i] = max(qq[l] + (long long) sz[r] * d, qq[r]);
st[i] = max(max(st[l], st[r]), qq[l] + pp[r] + d);
}
void update(int i, int x) {
i += n_;
sz[i]++, pp[i] = -x, qq[i] = x, st[i] = 0;
while (i > 1)
pul(i >>= 1);
}
int main() {
static int ii[N + M];
int i;
scanf("%d%d%d", &n, &m, &d);
for (i = 0; i < n + m; i++)
scanf("%d", &xx[i]);
for (i = 0; i < n + m; i++)
ii[i] = i;
sort(ii, 0, n + m);
for (i = 0; i < n + m; i++)
idx[ii[i]] = i;
build();
for (i = 0; i < n; i++)
update(idx[i], xx[i]);
for (i = n; i < n + m; i++) {
update(idx[i], xx[i]);
printf("%lld%s ", st[1] / 2, st[1] % 2 == 0 ? "" : ".5");
}
printf("\n");
return 0;
}
