#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
bool is = false;
if (a.empty()) return o << "{}";
for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
vvv() {}
};
#ifdef Doludu
#define test(args...) abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 1e5 + 7, logN = 18, K = 111, M = N * 20;
pii mer(pii a, pii b) {
return mp(min(a.X, b.X), max(a.Y, b.Y));
}
struct Seg {
int l, r, m, mn, mx, lzmn, lzmx;
Seg* ch[2];
Seg (int _l, int _r) : l(_l), r(_r), m(l + r >> 1), lzmn(-1), lzmx(-1) {
if (r - l > 1) {
ch[0] = new Seg(l, m);
ch[1] = new Seg(m, r);
pull();
} else {
mn = l, mx = l + 1;
}
}
void pull() {
mn = min(ch[0]->mn, ch[1]->mn);
mx = max(ch[0]->mx, ch[1]->mx);
}
void give_mn(int v) {
if (lzmn != -1 && lzmn <= v)
return;
mn = min(mn, v), lzmn = v;
}
void give_mx(int v) {
if (lzmx != -1 && lzmx >= v)
return;
mx = max(mx, v), lzmx = v;
}
void push() {
if (lzmn != -1)
ch[0]->give_mn(lzmn), ch[1]->give_mn(lzmn);
if (lzmx != -1)
ch[0]->give_mx(lzmx), ch[1]->give_mx(lzmx);
lzmn = lzmx = -1;
}
void modify(int a, int b, int mnv, int mxv) {
if (a <= l && r <= b)
give_mn(mnv), give_mx(mxv);
else {
push();
if (a < m)
ch[0]->modify(a, b, mnv, mxv);
if (m < b)
ch[1]->modify(a, b, mnv, mxv);
pull();
}
}
pii query(int a, int b) {
if (a <= l && r <= b)
return mp(mn, mx);
pii ans = mp(1 << 30, -1 << 30);
push();
if (a < m)
ans = mer(ans, ch[0]->query(a, b));
if (m < b)
ans = mer(ans, ch[1]->query(a, b));
return ans;
}
};
Seg* root[logN];
int main () {
owo;
int n, k, m, q;
cin >> n >> k >> m;
root[0] = new Seg(0, n);
for (int i = 0, l, r; i < m; ++i) {
cin >> l >> r;
if (l < r)
--l, root[0]->modify(l, min(l + k, r), 1 << 30, r);
else
--r, root[0]->modify(max(l - k, r), l, r, -1 << 30);
}
for (int j = 1; j < logN; ++j) {
root[j] = new Seg(0, n);
for (int i = 0; i < n; ++i) {
int l, r; tie(l, r) = root[j - 1]->query(i, i + 1);
tie(l, r) = root[j - 1]->query(l, r);
root[j]->modify(i, i + 1, l, r);
}
}
cin >> q;
while (q--) {
int l, r;
cin >> l >> r, --l, --r;
{
int curl, curr;
tie(curl, curr) = root[logN - 1]->query(l, l + 1);
if (r < curl || curr <= r) {
cout << -1 << '\n';
continue;
}
}
int curl = l, curr = l + 1, ans = 0;
for (int i = logN - 1; ~i; --i) {
int nxtl, nxtr; tie(nxtl, nxtr) = root[i]->query(curl, curr);
if (r < nxtl || nxtr <= r) {
ans |= 1 << i;
tie(curl, curr) = mp(nxtl, nxtr);
}
}
cout << ans + 1 << '\n';
}
}
