#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
const ll INF = 1e18, MOD = 1e9 + 7;
void solve();
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
ll q = 1;
while (q--) {
solve();
}
}
struct sparse_table1 {
vector<vector<ll>> v;
vector<ll> a;
ll n;
void build(ll n_, vector<ll> &b) {
v.resize(__lg(n_) + 1, vector<ll>(n_));
n = n_;
a = b;
for (ll i = 0; i < n; i++) {
v[0][i] = a[i];
}
for (ll j = 1; j <= __lg(n); j++) {
for (ll i = 0; i + (1 << j) <= n; i++) {
v[j][i] = min(v[j - 1][i], v[j - 1][i + (1 << (j - 1))]);
}
}
}
ll query(ll l, ll r) {
ll j = __lg(r - l);
return min(v[j][l], v[j][r - (1 << j)]);
}
};
struct sparse_table2 {
vector<vector<ll>> v;
vector<ll> a;
ll n;
void build(ll n_, vector<ll> &b) {
v.resize(__lg(n_) + 1, vector<ll>(n_));
n = n_;
a = b;
for (ll i = 0; i < n; i++) {
v[0][i] = a[i];
}
for (ll j = 1; j <= __lg(n); j++) {
for (ll i = 0; i + (1 << j) <= n; i++) {
v[j][i] = max(v[j - 1][i], v[j - 1][i + (1 << (j - 1))]);
}
}
}
ll query(ll l, ll r) {
ll j = __lg(r - l);
return max(v[j][l], v[j][r - (1 << j)]);
}
};
sparse_table2 t1;
sparse_table1 t2;
void solve() {
ll n, k; cin >> n >> k;
vector<ll> e1(n, -1), e2(n, n);
ll m; cin >> m;
for (ll i = 0; i < m; i++) {
ll a, b; cin >> a >> b;
a--, b--;
if (a <= b) {
e1[a] = max(e1[a], b);
} else {
e2[a] = min(e2[a], b);
}
}
t1.build(n, e1);
t2.build(n, e2);
vector<vector<ll>> upl(20, vector<ll>(n));
vector<vector<ll>> upr(20, vector<ll>(n));
vector<sparse_table1> s1(20);
vector<sparse_table2> s2(20);
for (ll i = 0; i < n; i++) {
ll l = i, r = i;
ll lf = min(l, t2.query(l, min(n - 1, r + k - 1) + 1));
ll rf = max(r, t1.query(max(0ll, l - k + 1), r + 1));
upl[0][i] = lf;
upr[0][i] = rf;
}
s1[0].build(n, upl[0]);
s2[0].build(n, upr[0]);
for (ll i = 1; i < 20; i++) {
for (ll v = 0; v < n; v++) {
ll l = upl[i - 1][v];
ll r = upr[i - 1][v];
ll lf = l, rf = r;
lf = min(lf, s1[i - 1].query(l, r + 1));
rf = max(rf, s2[i - 1].query(l, r + 1));
upl[i][v] = lf;
upr[i][v] = rf;
}
s1[i].build(n, upl[i]);
s2[i].build(n, upr[i]);
}
ll q; cin >> q;
while (q--) {
ll s, t; cin >> s >> t;
s--, t--;
ll cnt = 0, ans = INF;
ll l = s, r = s;
for (ll i = 19; i >= 0; i--) {
ll lf = l, rf = r;
lf = min(lf, s1[i].query(l, r + 1));
rf = max(rf, s2[i].query(l, r + 1));
if (lf <= t && t <= rf) continue;
l = lf, r = rf;
cnt += (1 << i);
}
cnt++;
ll lf = min(l, t2.query(l, min(n - 1, r + k - 1) + 1));
ll rf = max(r, t1.query(max(0ll, l - k + 1), r + 1));
if (lf <= t && t <= rf) {
ans = cnt;
}
if (ans == INF) cout << -1 << '\n';
else cout << ans << '\n';
}
}
