Problem: After hard work Igor decided to have some rest.

He decided to have a snail. He bought an aquarium with a slippery tree trunk in the center, and put a snail named Julia into the aquarium.

Igor noticed that sometimes Julia wants to climb onto the trunk, but can't do it because the trunk is too slippery. To help the snail Igor put some ropes on the tree, fixing the lower end of the i-th rope on the trunk on the height li above the ground, and the higher end on the height ri above the ground.

For some reason no two ropes share the same position of the higher end, i.e. all ri are distinct. Now Julia can move down at any place of the trunk, and also move up from the lower end of some rope to its higher end. Igor is proud of his work, and sometimes think about possible movements of the snail. Namely, he is interested in the following questions: «Suppose the snail is on the trunk at height x now. What is the highest position on the trunk the snail can get on if it would never be lower than x or higher than y?» Please note that Julia can't move from a rope to the trunk before it reaches the higher end of the rope, and Igor is interested in the highest position on the tree trunk.

Igor is interested in many questions, and not always can answer them. Help him, write a program that answers these questions.

Input

The first line contains single integer n (1 ≤ n ≤ 100000) — the height of the trunk.

The second line contains single integer m (1 ≤ m ≤ 100000) — the number of ropes.

The next m lines contain information about the ropes.

The i-th of these lines contains two integers li and ri (1 ≤ li ≤ ri ≤ n) — the heights on which the lower and the higher ends of the i-th rope are fixed, respectively. It is guaranteed that all ri are distinct.

The next line contains single integer q (1 ≤ q ≤ 100000) — the number of questions.

The next q lines contain information about the questions.

Each of these lines contain two integers x and y (1 ≤ x ≤ y ≤ n), where x is the height where Julia starts (and the height Julia can't get lower than), and y is the height Julia can't get higher than.

Output

For each question print the maximum reachable for Julia height.

Examples

Input

8
4
1 2
3 4
2 5
6 7
5
1 2
1 4
1 6
2 7
6 8


Output

2
2
5
5
7


Input

10
10
3 7
1 4
1 6
5 5
1 1
3 9
7 8
1 2
3 3
7 10
10
2 4
1 7
3 4
3 5
2 8
2 5
5 5
3 5
7 7
3 10


Output

2
7
3
3
2
2
5
3
7
10

Note

The picture of the first sample is on the left, the picture of the second sample is on the right. Ropes' colors are just for clarity, they don't mean anything.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
class node {
 public:
  int x;
  node() { x = 1e9; }
};
node operator+(node x, node y) {
  node res;
  res.x = max(x.x, y.x);
  return res;
}
node tree[N << 2];
int lazy[N << 2];
void doit(int x, int v) {
  if (!v) return;
  if (!lazy[x])
    lazy[x] = v;
  else
    lazy[x] = min(lazy[x], v);
  tree[x].x = min(tree[x].x, v);
}
void push(int x) {
  doit(x + x, lazy[x]);
  doit(x + x + 1, lazy[x]);
  lazy[x] = 0;
}
void update(int x, int l, int r, int x1, int x2, int d) {
  if (x2 < l or r < x1) return;
  if (x1 <= l and r <= x2) {
    doit(x, d);
    return;
  }
  push(x);
  int m = (l + r) >> 1;
  update(x + x, l, m, x1, x2, d);
  update(x + x + 1, m + 1, r, x1, x2, d);
  tree[x] = tree[x + x] + tree[x + x + 1];
}
int query(int x, int l, int r, int x1, int x2, int k) {
  if (r < x1 or x2 < l or tree[x].x <= k) return -1;
  if (l == r) {
    return tree[x].x > k ? l : -1;
  }
  int m = (l + r) >> 1;
  push(x);
  int res = query(x + x, l, m, x1, x2, k);
  if (res == -1) res = query(x + x + 1, m + 1, r, x1, x2, k);
  return res;
}
int n, m, q;
vector<int> rope[N];
vector<pair<int, int> > qu[N];
int ans[N];
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int l, r;
    scanf("%d %d", &l, &r);
    rope[l].push_back(r);
  }
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    int l, r;
    scanf("%d %d", &l, &r);
    qu[l].push_back({r, i});
  }
  for (int l = n; l >= 1; l--) {
    for (auto r : rope[l]) update(1, 1, n, l, r - 1, r);
    for (auto tmp : qu[l]) {
      int r, id;
      tie(r, id) = tmp;
      int res = query(1, 1, n, l, r - 1, r);
      if (res == -1) res = r;
      ans[id] = res;
    }
  }
  for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);
  return 0;
}