2 10 1 1 1
1
10
1
1 5 1 8
 4 4 1 0 1
1

1
1 2 1 4
 2 5 1 0 1
2

1
1 4 1 5
 10 10 1 8 4
10
2 3 4 5 6 7 8 9
10
1 1 3 1
2 1 7 1
1 1 9 1
7 1 4 1
10 1 7 1
2 1 7 1
3 1 2 1
5 1 2 1
10 1 5 1
6 1 9 1
 2 4 1 1 1
1
4
1
1 2 1 3
 2 2 0 1 1

1
1
1 2 2 2
 1000 1000 1 1 10
1
2
1
1 900 1 1000
 5 5 1 1 1
3
2
1
1 5 1 1
 2 4 1 1 1
1
2
1
2 3 2 4
 4 4 1 0 1
4

5
1 1 2 2
1 3 2 2
3 3 4 3
3 2 2 2
1 2 2 3

3
 2
 1
 3
4
4
3
3
4
3
3
4
3
 1
 3
 100
 4
 1
 6
4
3
5
4

#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  long long n, m, v, i, x, q, x1, y1, x2, y2;
  cin >> n >> m;
  cin >> n >> m >> v;
  vector<long long> a, b;
  while (n--) {
    cin >> x;
    a.push_back(x);
  }
  while (m--) {
    cin >> x;
    b.push_back(x);
  }
  cin >> q;
  while (q--) {
    long long ans = INT_MAX;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y1 - y2) << endl;
      continue;
    }
    if (a.size()) {
      x = lower_bound(a.begin(), a.end(), y1) - a.begin();
      if (x != a.size()) {
        ans = min(ans, abs(a[x] - y1) + abs(x2 - x1) + abs(y2 - a[x]));
      }
      if (x) {
        x--;
        ans = min(ans, abs(a[x] - y1) + abs(x2 - x1) + abs(y2 - a[x]));
      }
    }
    if (b.size()) {
      x = lower_bound(b.begin(), b.end(), y1) - b.begin();
      if (x != b.size()) {
        ans = min(ans,
                  abs(b[x] - y1) + (abs(x2 - x1) + v - 1) / v + abs(y2 - b[x]));
      }
      if (x) {
        x--;
        ans = min(ans,
                  abs(b[x] - y1) + (abs(x2 - x1) + v - 1) / v + abs(y2 - b[x]));
      }
    }
    cout << ans << endl;
  }
}
