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 long long int mod = 1e9 + 7;
const long long int INF = 1e9;
const long long int MAXN = 1e9;
int main() {
  long long int n, m, c_l, c_e, v;
  cin >> n >> m >> c_l >> c_e >> v;
  vector<long long int> st(c_l + 1);
  for (int i = 0; i < c_l; i++) cin >> st[i];
  st[c_l] = INF * INF;
  vector<long long int> el(c_e + 1);
  for (int i = 0; i < c_e; i++) cin >> el[i];
  el[c_e] = INF * INF;
  long long int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    long long int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    vector<long long int>::iterator itr = lower_bound(el.begin(), el.end(), y1);
    long long int left_elevator = *itr;
    ++itr;
    long long int right_elevator = *itr;
    vector<long long int>::iterator itr2 =
        lower_bound(st.begin(), st.end(), y1);
    long long int left_stair = *itr2;
    ++itr2;
    long long int right_stair = *itr2;
    long long int use_e =
        min(abs(left_elevator - y1), abs(right_elevator - y1)) +
        ceil(double(x2 - x1 + 1) / v);
    long long int use_s =
        min(abs(left_stair - y1), abs(right_stair - y1)) + x2 - x1 + 1;
    cout << min(use_s, use_e) + 1 << endl;
  }
  return 0;
}
