#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


using Double = double;
constexpr Double INF = 1e+100;

int N, Q;
Int V;
vector<Int> P;
vector<Int> W;
vector<Int> X0, Y0, X1, Y1;

int indexOf(Int x) {
  return (upper_bound(P.begin(), P.end(), x) - P.begin()) - 1;
}

namespace rmq {
constexpr int E = 18;
Int mn[E][1 << E], mx[E][1 << E];
void init() {
  mn[0][0] = mx[0][0] = 0;
  mn[0][N + 1] = mx[0][N + 1] = 0;
  for (int i = 0; i < N; ++i) {
    mn[0][i + 1] = mx[0][i + 1] = W[i];
  }
  for (int e = 0; e < E - 1; ++e) {
    for (int i = 0; i + (1 << (e + 1)) <= N + 2; ++i) {
      mn[e + 1][i] = min(mn[e][i], mn[e][i + (1 << e)]);
      mx[e + 1][i] = max(mx[e][i], mx[e][i + (1 << e)]);
    }
  }
}
pair<Int, Int> get(int iL, int iR) {
  if (iL > iR) swap(iL, iR);
  assert(-1 <= iL); assert(iL <= iR); assert(iR <= N);
  iL += 1;
  iR += 2;
  const int e = 31 - __builtin_clz(iR - iL);
  return make_pair(
    min(mn[e][iL], mn[e][iR - (1 << e)]),
    max(mx[e][iL], mx[e][iR - (1 << e)])
  );
}
}  // rmq

namespace brute {
vector<Int> fs;
Int calc(Int x) {
  const int i = indexOf(x);
  if (i < 0) return 0;
  if (i >= N) return fs[N];
  return fs[i] + W[i] * (x - P[i]);
}
vector<Double> run() {
cerr<<"[brute::run]"<<endl;
  fs.assign(N + 1, 0);
  for (int i = 0; i < N; ++i) {
    fs[i + 1] = fs[i] + W[i] * (P[i + 1] - P[i]);
  }
  vector<int> lefSmall(N), rigSmall(N);
  vector<int> lefLarge(N), rigLarge(N);
  {
    vector<pair<Int, int>> wis(N);
    for (int i = 0; i < N; ++i) wis[i] = make_pair(W[i], i);
    sort(wis.begin(), wis.end());
    {
      set<int> is{-1, N};
      for (int jL = 0, jR = 0; jL < N; jL = jR) {
        for (; jR < N && wis[jL].first == wis[jR].first; ++jR) {}
        for (int j = jL; j < jR; ++j) {
          const int i = wis[j].second;
          auto it = is.lower_bound(i);
          rigSmall[i] = *it;
          lefSmall[i] = *--it;
        }
        for (int j = jL; j < jR; ++j) {
          const int i = wis[j].second;
          is.insert(i);
        }
      }
    }
    reverse(wis.begin(), wis.end());
    {
      set<int> is{-1, N};
      for (int jL = 0, jR = 0; jL < N; jL = jR) {
        for (; jR < N && wis[jL].first == wis[jR].first; ++jR) {}
        for (int j = jL; j < jR; ++j) {
          const int i = wis[j].second;
          auto it = is.lower_bound(i);
          rigLarge[i] = *it;
          lefLarge[i] = *--it;
        }
        for (int j = jL; j < jR; ++j) {
          const int i = wis[j].second;
          is.insert(i);
        }
      }
    }
  }
// cerr<<"W = "<<W<<endl;
// cerr<<"  lefSmall = "<<lefSmall<<", rigSmall = "<<rigSmall<<endl;
// cerr<<"  lefLarge = "<<lefLarge<<", rigLarge = "<<rigLarge<<endl;
  vector<Double> ans(Q, INF);
  for (int q = 0; q < Q; ++q) {
    const Int f0 = calc(X0[q]);
    const Int f1 = calc(X1[q]);
    auto check = [&](Int w, Int x, Int f) -> void {
      Int dx = 0, dy = 0;
      dx += abs(x - X0[q]);
      dx += abs(x - X1[q]);
      dy += (X0[q] <= x) ? (f - f0) : (f0 - f);
      dy += (X1[q] <= x) ? (f - f1) : (f1 - f);
      /*
        yoko: (dx/V) sec
        tate: katteni (dy/V)
      */
      Double cost = 0.0;
      cost += (Double)dx / V;
      if (V * (Y1[q] - Y0[q]) >= dy) {
        cost += ((Y1[q] - Y0[q]) - (Double)dy / V) / (w + V);
      } else {
        cost += ((Y1[q] - Y0[q]) - (Double)dy / V) / (w - V);
      }
// cerr<<"check i="<<i<<" x="<<x<<" f="<<f<<": w="<<w<<", dx="<<dx<<", dy="<<dy<<", cost="<<cost<<endl;
      chmin(ans[q], cost);
    };
    const int i0 = indexOf(X0[q]);
    const int i1 = indexOf(X1[q]);
    const auto inside = rmq::get(i0, i1);
    check(inside.first, X0[q], f0);
    check(inside.second, X0[q], f0);
    /*
    for (int i = min(i0, i1); i >= 0; --i) {
      check((i == 0) ? 0 : W[i - 1], P[i], fs[i]);
    }
    for (int i = max(i0, i1) + 1; i <= N; ++i) {
      check((i == N) ? 0 : W[i], P[i], fs[i]);
    }
    */
    check(0, P[0], fs[0]);
    check(0, P[N], fs[N]);
    for (int i = min(i0, i1) - 1; i >= 0; i = lefSmall[i]) check(W[i], P[i + 1], fs[i + 1]);
    for (int i = min(i0, i1) - 1; i >= 0; i = lefLarge[i]) check(W[i], P[i + 1], fs[i + 1]);
    for (int i = max(i0, i1) + 1; i < N; i = rigSmall[i]) check(W[i], P[i], fs[i]);;
    for (int i = max(i0, i1) + 1; i < N; i = rigLarge[i]) check(W[i], P[i], fs[i]);;
  }
  return ans;
}
}  // brute


int main() {
  for (; ~scanf("%d%d%lld", &N, &Q, &V); ) {
    P.resize(N + 1);
    for (int i = 0; i <= N; ++i) {
      scanf("%lld", &P[i]);
    }
    W.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &W[i]);
    }
    X0.resize(Q);
    Y0.resize(Q);
    X1.resize(Q);
    Y1.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%lld%lld%lld%lld", &X0[q], &Y0[q], &X1[q], &Y1[q]);
    }
    
    rmq::init();
    
    const auto ans = brute::run();
    for (int q = 0; q < Q; ++q) {
      printf("%.8f\n", ans[q]);
    }
  }
  return 0;
}