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() {
  int n, m, Cl, Ce, v;
  cin >> n >> m >> Cl >> Ce >> v;
  vector<int> L(Cl);
  vector<int> E(Ce);
  for (int i = 0; i < Cl; ++i) cin >> L[i];
  for (int i = 0; i < Ce; ++i) cin >> E[i];
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    int x0, y0, x, y;
    cin >> y0 >> x0 >> y >> x;
    int ans = n + m;
    if (L.size() != 0 && x0 < L.back()) {
      int lx = L[upper_bound(L.begin(), L.end(), x0) - L.begin()];
      ans = min(ans, abs(lx - x0) + abs(lx - x) + abs(y - y0));
    }
    if (L.size() && x0 > L[0]) {
      int lx = L[upper_bound(L.begin(), L.end(), x0) - 1 - L.begin()];
      ans = min(ans, abs(lx - x0) + abs(lx - x) + abs(y - y0));
    }
    if (E.size() != 0 && x0 < E.back()) {
      int ex = E[upper_bound(E.begin(), E.end(), x0) - E.begin()];
      ans = min(ans, abs(ex - x0) + abs(ex - x) + (abs(y - y0) + v - 1) / v);
    }
    if (E.size() != 0 && x0 > E[0]) {
      int ex = E[upper_bound(E.begin(), E.end(), x0) - 1 - E.begin()];
      ans = min(ans, abs(ex - x0) + abs(ex - x) + (abs(y - y0) + v - 1) / v);
    }
    if (ans == n + m) ans = abs(x - x0);
    cout << ans << endl;
  }
  return 0;
}
