#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int p[100100], t[100100];
int id[100100], L[100100], R[100100], ans[100100];
bool cmp(int i, int j) { return R[i] < R[j]; }
int mx[100100 << 2], flag[100100 << 2];
void push_up(int u) { mx[u] = max(mx[(u << 1)], mx[((u << 1) | 1)]); }
void push_down(int u) {
  if (flag[u]) {
    smax(mx[(u << 1)], flag[u]);
    smax(flag[(u << 1)], flag[u]);
    smax(mx[((u << 1) | 1)], flag[u]);
    smax(flag[((u << 1) | 1)], flag[u]);
    flag[u] = 0;
  }
}
void update(int u, int L, int R, int l, int r, int val) {
  if (l >= R || r <= L) return;
  if (l <= L && R <= r) {
    smax(mx[u], val);
    smax(flag[u], val);
    return;
  }
  push_down(u);
  update((u << 1), L, (L + R >> 1), l, r, val);
  update(((u << 1) | 1), (L + R >> 1), R, l, r, val);
  push_up(u);
}
int calc(int u, int L, int R, int l, int r) {
  if (l >= R || r <= L) return 0;
  if (l <= L && R <= r) return mx[u];
  push_down(u);
  return max(calc((u << 1), L, (L + R >> 1), l, r),
             calc(((u << 1) | 1), (L + R >> 1), R, l, r));
}
int find_root(int L, int R, int l, int r) {
  if (l == r) return l;
  int nr = calc(1, L, R, l, r + 1);
  if (r >= nr) return r;
  int ans;
  update(1, L, R, l, l + 1, ans = find_root(L, R, l, nr));
  return ans;
}
int main() {
  int n, m, q;
  gn(n, m);
  for (int i = 1; i <= n; i++) p[i] = i, t[i] = i;
  for (int i = 0; i < m; i++) {
    int first, second;
    gn(first, second);
    p[second] = first;
  }
  gn(q);
  for (int i = 0; i < q; i++) {
    gn(L[i], R[i]);
    id[i] = i;
  }
  sort(id, id + q, cmp);
  for (int i = 1, j = 0; i <= n; i++) {
    update(1, 1, n + 1, p[i], p[i] + 1, i);
    smax(t[p[i]], i);
    while (j < q && R[id[j]] == i) {
      ans[id[j]] = find_root(1, n + 1, L[id[j]], t[L[id[j]]]);
      j++;
    }
  }
  for (int i = 0; i < q; i++) println(ans[i]);
  return 0;
}
