#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, inf = 1e9;
int mx[4 * maxn], mx2[4 * maxn], lz[4 * maxn];
int a[maxn];
void Merge(int id) {
  mx[id] = max(mx[2 * id], mx[2 * id + 1]);
  mx2[id] = max(mx2[2 * id], mx2[2 * id + 1]);
  if (mx[id] != mx[2 * id]) mx2[id] = max(mx2[id], mx[2 * id]);
  if (mx[id] != mx[2 * id + 1]) mx2[id] = max(mx2[id], mx[2 * id + 1]);
}
void shift(int l, int r, int id) {
  if (lz[id] == -1) return;
  if (r - l > 1) {
    if (mx[id] == max(mx[2 * id], lz[2 * id])) lz[2 * id] = lz[id];
    if (mx[id] == max(mx[2 * id + 1], lz[2 * id + 1])) lz[2 * id + 1] = lz[id];
  }
  mx[id] = lz[id];
  lz[id] = -1;
}
void build(int l = 0, int r = maxn, int id = 1) {
  lz[id] = -1;
  if (r - l == 1) {
    mx[id] = l;
    mx2[id] = -inf;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, 2 * id);
  build(mid, r, 2 * id + 1);
  Merge(id);
}
void Add(int f, int s, int x, int y, int l = 0, int r = maxn, int id = 1) {
  if (f >= s || l >= r) return;
  shift(l, r, id);
  if (s <= l || r <= f || mx[id] < x) return;
  if (f <= l && r <= s && mx2[id] < x) {
    lz[id] = y;
    shift(l, r, id);
    return;
  }
  int mid = (l + r) >> 1;
  Add(f, s, x, y, l, mid, 2 * id);
  Add(f, s, x, y, mid, r, 2 * id + 1);
  Merge(id);
}
int Ask(int pos, int l = 0, int r = maxn, int id = 1) {
  shift(l, r, id);
  if (r - l == 1) return mx[id];
  int mid = (l + r) >> 1;
  if (pos < mid) return Ask(pos, l, mid, 2 * id);
  return Ask(pos, mid, r, 2 * id + 1);
}
int any[maxn], ans[maxn];
vector<pair<int, int> > v[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  build();
  memset(any, -1, sizeof any);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    any[--b] = --a;
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int a, b;
    cin >> a >> b;
    v[--b].push_back({--a, i});
  }
  for (int i = 0; i < n; i++) {
    if (any[i] != -1) Add(0, any[i] + 1, any[i], i);
    for (pair<int, int> p : v[i]) ans[p.second] = Ask(p.first);
  }
  for (int i = 0; i < q; i++) {
    cout << ans[i] + 1 << "\n";
  }
  return 0;
}
