// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define ull unsigned long long
#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 500005
#define inf 0x3f3f3f3f

int n,q,v;
int p[maxn],d[maxn],mx=0,mn=0;
int sum[maxn];

int get(int x){
	if(x<=p[0]) return 0;
	if(x>=p[n]) return n+1;
	int i=lower_bound(p,p+n+1,x)-p;
	return i;
}

signed main()
{
	n=read(),q=read(),v=read();
	For(i,0,n)p[i]=read();
	For(i,1,n)d[i]=read(),sum[i]=sum[i-1]+d[i]*(p[i]-p[i-1]),mx=max(mx,d[i]),mn=min(mn,d[i]);
	For(_,1,q){
		int x=read(),y=read(),xx=read(),yy=read();
		if(x>xx) swap(x,xx);
		if(n==0){
			double res=abs(x-xx)+abs(y-yy);
			res/=v;
			printf("%.10lf\n",res);
			continue;
		}
		if(x==p[0] && xx==p[n]){
			double dy=yy-y;
			dy-=(sum[n]/v);
		//	cout<<"dy "<<dy<<"\n";
			double res=1.0*(p[n]-p[0])/v;
			if(dy>0) res+=1.0*dy/(v+mx);
			if(dy<0) res+=1.0*(-dy)/(v+(-mn));
			printf("%.10lf\n",res);
			continue;
		}
		double res=1e18;
		int i1=get(x),i2=get(xx);
		
		auto ask=[&](int l,int r){
			if(l>r)swap(l,r);
			int i1=get(l),i2=get(r);
			if(i1==i2) {
				double res=1.0*d[i1]*(r-l);
				return res/v;
			} 
			double res=0;
			res+=1.0*d[i1]*(p[i1]-l);
			res+=1.0*d[i2]*(r-p[i2-1]);
			if(i1+1<=i2-1) res+=sum[i2-1]-sum[i1];
			res/=v;
			return res;
		};
		For(i,0,n+1){
			int ql,qr;
			if(i>=1 && i<=n) ql=p[i-1],qr=p[i];
			else if(i==0) ql=-1e18,qr=p[0];
			else if(i==n+1) qr=1e18,ql=p[n];
			
			double now=0,dy=yy-y;
			
				if(ql>=xx){
					now+=(ql-xx)*2+(xx-x);
					dy-=ask(xx,ql)*2;
				}
				else if(qr<=x){
					now+=(x-qr)*2+(xx-x);
					dy-=ask(qr,x)*2;
				}
				else{
					now+=(xx-x);
				}
				dy-=ask(x,xx);
			
			now/=v;
		//	cout<<"i: "<<i<<" "<<now<<" "<<dy<<"\n";
			
			if(dy>0) now+=1.0*dy/(v+d[i]);
			if(dy<0) now+=1.0*(-dy)/(v-d[i]);
			res=min(res,now);
		}
		printf("%.10lf\n",res);
	}
	return 0;
}
/*
1 2 10
-5 5
5
-5 -20 5 20
10 20 -10 -20
*/