#include <bits/stdc++.h>

typedef long long ll;
#define int long long
const int N = 2e5 + 50;
const ll inf = 1e18;

int n, m, id[N], T[N << 2];
ll a[N], b[N], d, mx[N << 2], mn[N << 2], lzy[N << 2];
std::pair<ll, int> c[N];

void build(int k, int l, int r) {
	mx[k] = -inf, mn[k] = inf, lzy[k] = 0;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(k * 2, l, mid);
	build(k * 2 + 1, mid + 1, r);
}

inline void pushdown(int k) {
	if (lzy[k]) {
		mn[k * 2] += lzy[k], mn[k * 2 + 1] += lzy[k];
		mx[k * 2] += lzy[k], mx[k * 2 + 1] += lzy[k];
		lzy[k * 2] += lzy[k], lzy[k * 2 + 1] += lzy[k];
		lzy[k] = 0;
	}
}

void mdf(int k, int l, int r, int x, int d) {
	if (l == r) return (void)(mx[k] = mn[k] = d, lzy[k] = 0, T[k] = 1);
	int mid = (l + r) >> 1; pushdown(k);
	if (x <= mid) mdf(k * 2, l, mid, x, d);
	else mdf(k * 2 + 1, mid + 1, r, x, d);
	mx[k] = std::max(mx[k * 2], mx[k * 2 + 1]);
	mn[k] = std::min(mn[k * 2], mn[k * 2 + 1]);
	T[k] = T[k * 2] + T[k * 2 + 1];
}

void modify(int k, int l, int r, int x, int y, int d) {
	if (x <= l && r <= y) return (void)(mn[k] += d, mx[k] += d, lzy[k] += d);
	int mid = (l + r) >> 1; pushdown(k);
	if (x <= mid) modify(k * 2, l, mid, x, y, d);
	if (y > mid) modify(k * 2 + 1, mid + 1, r, x, y, d);
	mx[k] = std::max(mx[k * 2], mx[k * 2 + 1]);
	mn[k] = std::min(mn[k * 2], mn[k * 2 + 1]);
}

ll qmn(int k, int l, int r, int x, int y) {
	if (x <= l && r <= y) return mn[k];
	int mid = (l + r) >> 1; ll res = inf; pushdown(k);
	if (x <= mid) res = qmn(k * 2, l, mid, x, y);
	if (y > mid) res = std::min(res, qmn(k * 2 + 1, mid + 1, r, x, y));
	return res;
}

ll qmx(int k, int l, int r, int x, int y) {
	if (x <= l && r <= y) return mx[k];
	int mid = (l + r) >> 1; ll res = -inf; pushdown(k);
	if (x <= mid) res = qmx(k * 2, l, mid, x, y);
	if (y > mid) res = std::max(res, qmx(k * 2 + 1, mid + 1, r, x, y));
	return res;
}

int qcnt(int k, int l, int r, int x, int y) {
	if (x <= l && r <= y) return T[k];
	int mid = (l + r) >> 1, res = 0; pushdown(k);
	if (x <= mid) res = qcnt(k * 2, l, mid, x, y);
	if (y > mid) res += qcnt(k * 2 + 1, mid + 1, r, x, y);
	return res;
}

signed main() {
	scanf("%d%d%lld", &n, &m, &d);
	for (int i = 1; i <= n; ++i) scanf("%lld", a + i);
	for (int i = 1; i <= m; ++i) scanf("%lld", b + i), c[i + n] = std::make_pair(b[i], i + n);
	std::sort(a + 1, a + 1 + n);
	for (int i = 1; i <= n; ++i) c[i] = std::make_pair(a[i], i);
	std::sort(c + 1, c + 1 + n + m);
	for (int i = 1; i <= n + m; ++i) id[c[i].second] = i;
	//for (int i = 1; i <= n + m; ++i) printf("%d ", id[i]); puts("");
	build(1, 1, n + m);
	for (int i = 1; i <= n; ++i) mdf(1, 1, n + m, id[i], a[i] - d * i);
	ll res = 0;
	for (int i = 2; i <= n + m; ++i)
		res = std::max(res, qmx(1, 1, n + m, 1, i - 1) - qmn(1, 1, n + m, i, n + m));
	//printf("%lld\n", res);
	for (int i = 1; i <= m; ++i) {
		//printf("i = %d, id[i] = %d\n", i, id[i]);
		mdf(1, 1, n + m, id[i + n], b[i] - d - d * qcnt(1, 1, n + m, 1, id[i + n]));
		if (id[i + n] < n + m) modify(1, 1, n + m, id[i + n] + 1, n + m, -d);
		//for (int j = 1; j <= n + m; ++j) printf("%lld %lld %d\n", qmx(1, 1, n + m, 1, j), qmn(1, 1, n + m, j, n + m), qcnt(1, 1, n + m, j, j));
		if (id[i + n] > 1) res = std::max(res, qmx(1, 1, n + m, 1, id[i + n] - 1) - qmn(1, 1, n + m, id[i + n], n + m));
		if (id[i + n] < n + m) res = std::max(res, qmx(1, 1, n + m, 1, id[i + n]) - qmn(1, 1, n + m, id[i + n] + 1, n + m));
		//printf("%lld\n", res);
		if (i + n == 1) printf("0");
		else {
			printf("%lld", res / 2);
			if (res & 1) printf(".5");
		}
		putchar(i == m ? '\n' : ' ');
	}
	return 0;
}