#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int MD = 1000000007;
const int K = 1500;
int n, m;
vector<int> L[N];
vector<pair<int, int> > queR[N];
vector<pair<int, int> > queL[N];
int R[N], ans[N], g[N];
int f[N / K + 15][N];
int t[2 * N];
int get(int l, int r) {
  int ans = l;
  l += n - 1;
  r += n - 1;
  while (l <= r) {
    if (l & 1) {
      if (ans < t[l]) {
        ans = t[l];
      }
      l++;
    }
    if (~r & 1) {
      if (ans < t[r]) {
        ans = t[r];
      }
      r--;
    }
    l >>= 1;
    r >>= 1;
  }
  return ans;
}
void update(int p, int v) {
  p += n - 1;
  t[p] = v;
  while (p > 1) {
    t[p >> 1] = max(t[p], t[p ^ 1]);
    p >>= 1;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    int x, y;
    cin >> x >> y;
    L[x].push_back(y);
    R[y] = x;
  }
  for (int i = 1; i <= n; ++i) {
    sort(L[i].begin(), L[i].end());
  }
  int q;
  cin >> q;
  for (int y = K; y <= n; y += K) {
    memset(t, 0, sizeof(t));
    for (int x = y; x >= 1; --x) {
      while (g[x] + 1 < L[x].size() && L[x][g[x] + 1] <= y) {
        g[x]++;
      }
      if (!L[x].empty() && L[x][g[x]] <= y) {
        f[y / K][x] = get(x, L[x][g[x]]);
      } else {
        f[y / K][x] = x;
      }
      update(x, f[y / K][x]);
    }
  }
  for (int i = 1; i <= q; ++i) {
    int x, y;
    cin >> x >> y;
    queR[y].push_back(make_pair(x, i));
    queL[x].push_back(make_pair(y, i));
    int res = 0;
    if (y - x <= 2 * K) {
      res = x;
      for (int j = x + 1; j <= y; ++j) {
        if (R[j] >= x && R[j] <= res) {
          res = j;
        }
      }
    } else {
      res = f[y / K][x];
      for (int j = y / K * K + 1; j <= y; ++j) {
        if (R[j] >= x && R[j] <= res) {
          res = j;
        }
      }
    }
    cout << res << "\n";
  }
  return 0;
}
