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

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author yassin
 */

#include <bits/stdc++.h>

using namespace std;

class TaskC {
public:
    void solve(istream& in, ostream& out) {
        int n, m, cl, ce, v;
        in >> n >> m >> cl >> ce >> v;
        vector<int> stairs(cl), elev(ce);
        for (int i = 0; i < cl; ++i) {
            in >> stairs[i];
        }
        for (int i = 0; i < ce; ++i) {
            in >> elev[i];
        }
        int q;
        in >> q;
        for (int i = 0; i < q; ++i) {
            int x1, y1, x2, y2;
            in >> x1 >> y1 >> x2 >> y2;
            int res = 1'000'000'000;
            
            auto s_it = upper_bound(begin(stairs), end(stairs), y1);
            if (s_it != end(stairs)) {
                int loc = *s_it;
                res = min(res, abs(loc - y1) + abs(x2 - x1) + abs(y2 - loc));
            }
            if (s_it != begin(stairs)) {
                int loc = *--s_it;
                res = min(res, abs(loc - y1) + abs(x2 - x1) + abs(y2 - loc));
            }
            
            auto e_it = upper_bound(begin(elev), end(elev), y1);
            if (e_it != end(elev)) {
                int loc = *e_it;
                res = min(res, abs(loc - y1) + abs((x2 - x1 + v - 1) / v) + abs(y2 - loc));
            }
            if (e_it != begin(elev)) {
                int loc = *--e_it;
                res = min(res, abs(loc - y1) + abs((x2 - x1 + v - 1) / v) + abs(y2 - loc));
            }
            
            out << res << "\n";
        }
    }
};

int main() {
	std::ios::sync_with_stdio(false); cin.tie(nullptr);
	TaskC solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}
