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 N = 1e5 + 5;
int l[N], v[N], x, y, x2, y2;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, cl, cv, s, q;
  cin >> n >> m >> cl >> cv >> s;
  for (int i = 1; i <= cl; i++) cin >> l[i];
  for (int i = 1; i <= cv; i++) cin >> v[i];
  cin >> q;
  while (q--) {
    int ans = INT_MAX;
    cin >> x >> y >> x2 >> y2;
    int p1, p2;
    p1 = lower_bound(l + 1, l + cl + 1, y) - l;
    p2 = lower_bound(v + 1, v + cv + 1, y) - v;
    int pp1 = p1 - 1, pp2 = p2 - 1;
    if (p1 != 0 && p1 <= m)
      ans = min(ans, abs(l[p1] - y) + abs(l[p1] - y2) + abs(x - x2));
    if (pp1 != 0 && pp1 <= m)
      ans = min(ans, abs(l[pp1] - y) + abs(l[pp1] - y2) + abs(x - x2));
    if (p2 != 0 && p2 <= m)
      ans = min(ans, abs(v[p2] - y) + abs(v[p2] - y2) + abs(x - x2) / s +
                         (abs(x - x2) % s == 0 ? 0 : 1));
    if (pp2 != 0 && pp2 <= m)
      ans = min(ans, abs(v[pp2] - y) + abs(v[pp2] - y2) + abs(x - x2) / s +
                         (abs(x - x2) % s == 0 ? 0 : 1));
    cout << ans << endl;
  }
}
