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_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, cl, ce, v, i, q;
  vector<int> e, l;
  cin >> n >> m >> cl >> ce >> v;
  l.push_back(-INT_MAX);
  for (i = 0; i < cl; ++i) {
    cin >> q;
    l.push_back(--q);
  }
  l.push_back(INT_MAX);
  e.push_back(-INT_MAX);
  for (i = 0; i < ce; ++i) {
    cin >> q;
    e.push_back(--q);
  }
  e.push_back(INT_MAX);
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 > x2) swap(x1, x2);
    if (--y1 > --y2) swap(y1, y2);
    vector<int>::iterator it;
    int right = *(it = upper_bound(l.begin() + 1, l.end(), y1));
    int left = *(--it);
    long long d = min((long long)y1 - left, (long long)right - y2) *
                  (right > y2 && x1 != x2);
    long long ans = 2 * d + x2 - x1 + y2 - y1;
    right = *(it = upper_bound(e.begin() + 1, e.end(), y1));
    left = *(--it);
    d = min((long long)y1 - left, (long long)right - y2) *
        (right > y2 && x1 != x2);
    ans = min(ans, 2 * d + (x2 - x1) / v + ((x2 - x1) % v > 0) + y2 - y1);
    cout << ans << endl;
  }
  return 0;
}
