#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
//using u128 = __uint128_t;
const int cox[4] = {1, 0, -1, 0};
const int coy[4] = {0, -1, 0, 1};
const ll mod = 1e9 + 7, pr = 31;
const int mxn = 4e5 + 5, mxd = 250 * 250, sq = 500, mxv = 2e6 + 1;
const int max_iter = 8e4, global_iter = 15e5 + 5;
//const int base = (1 <<18);
const ll inf = 1e16 + 5, neg = -69420, inf2 = 1e14;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// have fun!
int n, m, d;
ll lz[4 * mxn + 1], mx[4 * mxn + 1], mn[4 * mxn + 1], a[mxn + 1];
int bit[mxn + 1];
ll ans = 0;
void pull(int nd){
mx[nd] = max(mx[nd << 1], mx[nd << 1 | 1]);
mn[nd] = min(mn[nd << 1], mn[nd << 1 | 1]);
}
void go(int nd, ll v){
lz[nd] += v; mx[nd] += v; mn[nd] += v;
}
void push(int nd){
ll &v = lz[nd];
go(nd << 1, v); go(nd << 1 | 1, v);
v = 0;
}
void updadd(int nd, int l, int r, int ql, int qr, ll v){
if(ql > r || qr < l)return;
if(ql <= l && qr >= r){
//cout << l << " " << r << " " << v << "\n";
go(nd, v);
return;
}
int mid = (l + r) >> 1;
push(nd);
updadd(nd << 1, l, mid, ql, qr, v); updadd(nd << 1 | 1, mid + 1, r, ql, qr, v);
pull(nd);
}
void updset(int nd, int l, int r, int id, ll v){
if(l == r){
//cout << l << " " << v << "\n";
mx[nd] = mn[nd] = v; return;
}
int mid = (l + r) >> 1;
push(nd);
if(id <= mid)updset(nd << 1, l, mid, id, v);
else updset(nd << 1 | 1, mid + 1, r, id, v);
pull(nd);
//cout << l << " " << r << " " << mx[nd] << "\n";
}
ll getmx(int nd, int l, int r, int ql, int qr){
if(ql > r || qr < l)return(-inf);
if(ql <= l && qr >= r)return(mx[nd]);
int mid = (l + r) >> 1;
push(nd);
return(max(getmx(nd << 1, l, mid, ql, qr), getmx(nd << 1 | 1, mid + 1, r, ql, qr)));
}
ll getmn(int nd, int l, int r, int ql, int qr){
if(ql > r || qr < l)return(inf);
if(ql <= l && qr >= r)return(mn[nd]);
int mid = (l + r) >> 1;
push(nd);
return(min(getmn(nd << 1, l, mid, ql, qr), getmn(nd << 1 | 1, mid + 1, r, ql, qr)));
}
vt<pii>comp;
void upd(int p, int v){
while(p <= sz(comp)){
bit[p] += v; p += p & (-p);
}
}
int get(int p){
int ans = 0;
while(p){
ans += bit[p]; p -= p & (-p);
}
return(ans);
}
void add(pii curr){
int id = lower_bound(ALL(comp), curr) - comp.begin() + 1;
ll kth = get(id - 1) + 1;
updadd(1, 1, sz(comp), id + 1, sz(comp), d);
upd(id, 1);
updset(1, 1, sz(comp), id, kth * d - curr.fi);
ans = max(ans, getmx(1, 1, sz(comp), id, sz(comp)) - getmn(1, 1, sz(comp), 1, id));
}
void solve(){
cin >> n >> m >> d;
for(int i = 1; i <= 4 * (n + m); i++){
mx[i] = -inf; mn[i] = inf;
}
for(int i = 1; i <= n + m; i++){
cin >> a[i]; comp.pb(mpp(a[i], i));
}
sort(ALL(comp));
for(int i = 1; i <= n + m; i++){
add(mpp(a[i], i));
//cout << ans << ' ';
if(i > n){
if(ans % 2 == 0)cout << ans / 2 << " ";
else cout << fixed << setprecision(1) << ans / 2.0 << " ";
}
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen("KHONG.inp", "r", stdin);
//freopen("KHONG.out", "w", stdout);
int tt; tt = 1;
while(tt--)solve();
return(0);
}
