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;
const int maxn = 100010;
const int INF = 1 << 30;
int st[maxn], el[maxn];
int n, m, stnum, elnum, v;
bool check1(int x) { return x >= 1 && x <= stnum; }
bool check2(int x) { return x >= 1 && x <= elnum; }
int main() {
  scanf("%d%d%d%d%d", &n, &m, &stnum, &elnum, &v);
  for (int i = 1; i <= stnum; i++) scanf("%d", &st[i]);
  for (int i = 1; i <= elnum; i++) scanf("%d", &el[i]);
  int q;
  scanf("%d", &q);
  while (q--) {
    int x1, y1, x2, y2;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    if (x1 > x2) {
      swap(x1, x2);
      swap(y1, y2);
    }
    int ans = INF;
    if (x1 == x2)
      ans = abs(y1 - y2);
    else {
      int ans1, ans2;
      int tmp = lower_bound(st + 1, st + stnum + 1, y1) - st;
      ans1 =
          min(check1(tmp) ? (abs(y1 - st[tmp]) + abs(y2 - st[tmp])) : INF,
              (check1(tmp - 1) ? abs(y1 - st[tmp - 1]) + abs(y2 - st[tmp - 1])
                               : INF)) +
          (x2 - x1);
      tmp = lower_bound(el + 1, el + elnum + 1, y1) - el;
      if (tmp == 0)
        ans2 = INF;
      else
        ans2 =
            min(check2(tmp) ? abs(y1 - el[tmp]) + abs(y2 - el[tmp]) : INF,
                (check2(tmp - 1) ? abs(y1 - el[tmp - 1]) + abs(y2 - el[tmp - 1])
                                 : INF)) +
            (x2 - x1) / v + ((x2 - x1) % v != 0);
      ans = min(ans1, ans2);
    }
    printf("%d\n", ans);
  }
  return 0;
}
