#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int INF = 1e9 + 69;
pair<int, int> combine(pair<int, int> x, pair<int, int> y){
return make_pair(min(x.first, y.first), max(x.second, y.second));
}
struct SegmentTree{
int n;
vector<pair<int, int>> a;
SegmentTree(int _n){
n = _n;
a.resize(n * 2 + 2, {INF, -INF});
}
void update(int i, pair<int, int> v){
i += n;
while(i > 0){
a[i] = combine(a[i], v);
i >>= 1;
}
}
pair<int, int> get(int l, int r){
l += n; r += n + 1;
pair<int, int> ans = {INF, -INF};
while(l < r){
if (l & 1) ans = combine(ans, a[l++]);
if (r & 1) ans = combine(ans, a[--r]);
l >>= 1; r >>= 1;
}
return ans;
}
};
struct SegmentTreeDiligent{
int n;
vector<pair<int, int>> a;
SegmentTreeDiligent(int _n){
n = _n;
a.resize(n * 2 + 2, {INF, -INF});
}
pair<int,int> get(int i){
i += n;
pair<int, int> ans = {INF, -INF};
while(i > 0){
ans = combine(ans, a[i]);
i >>= 1;
}
return ans;
}
void update(int l, int r, pair<int, int> v){
l += n; r += n + 1;
while(l < r){
if (l & 1) {
a[l] = combine(v, a[l]);
l++;
}
if (r & 1) {
--r;
a[r] = combine(v, a[r]);
}
l >>= 1; r >>= 1;
}
}
};
void solve(){
int n, k; cin >> n >> k;
int m; cin >> m;
SegmentTreeDiligent dih(n);
for(int i = 1; i <= n; ++i) dih.update(i, i, make_pair(i, i));
for(int i = 0; i < m; ++i){
int a, b; cin >> a >> b;
if (a < b){
int c = min(b, a + k - 1);
dih.update(a, c, make_pair(b, b));
}
else{
int c = max(b, a - k + 1);
dih.update(c, a, make_pair(b, b));
}
}
vector<pair<int,int>> arr(n+1);
for(int i = 1; i <= n; ++i) arr[i] = dih.get(i);
vector<SegmentTree> st;
st.push_back(SegmentTree(n));
for(int i = 1; i <= n; ++i) st[0].update(i, arr[i]);
for(int j = 1; j < 20; ++j) {
st.push_back(SegmentTree(n));
for(int i= 1; i <= n; ++i){
pair<int, int> range = st[j-1].get(i, i);
st[j].update(i, st[j-1].get(range.first, range.second));
}
}
int q; cin >> q;
while(q--){
int u, v; cin >> u >> v;
int ans = 0;
pair<int, int> range = {u, u};
for(int j = 19; j >= 0; --j){
pair<int, int> _range = st[j].get(range.first, range.second);
if (_range.first <= v && v <= _range.second) continue;
range = _range;
ans += MASK(j);
}
ans++;
if (ans == MASK(20)) cout << -1 << "\n";
else cout << ans << "\n";
}
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
