Today the North Pole hosts an Olympiad in a sport called... toy igloo skyscrapers' building!

There are n walruses taking part in the contest. Each walrus is given a unique number from 1 to n. After start each walrus begins to build his own igloo skyscraper. Initially, at the moment of time equal to 0, the height of the skyscraper i-th walrus is equal to ai. Each minute the i-th walrus finishes building bi floors.

The journalists that are reporting from the spot where the Olympiad is taking place, make q queries to the organizers. Each query is characterized by a group of three numbers li, ri, ti. The organizers respond to each query with a number x, such that:

1. Number x lies on the interval from li to ri inclusive (li ≤ x ≤ ri).

2. The skyscraper of the walrus number x possesses the maximum height among the skyscrapers of all walruses from the interval [li, ri] at the moment of time ti.

For each journalists' query print the number of the walrus x that meets the above-given criteria. If there are several possible answers, print any of them.

Input

The first line contains numbers n and q (1 ≤ n, q ≤ 105). Next n lines contain pairs of numbers ai, bi (1 ≤ ai, bi ≤ 109). Then follow q queries i the following format li, ri, ti, one per each line (1 ≤ li ≤ ri ≤ n, 0 ≤ ti ≤ 106). All input numbers are integers.

Output

For each journalists' query print the number of the walrus x that meets the criteria, given in the statement. Print one number per line.

Examples

Input

5 4
4 1
3 5
6 2
3 5
6 5
1 5 2
1 3 5
1 1 0
1 5 0


Output

5
2
1
5


Input

5 4
6 1
5 1
2 5
4 3
6 1
2 4 1
3 4 5
1 4 5
1 2 0


Output

3
3
3
1
#include <bits/stdc++.h>
using namespace std;
int const maxn = 1e5 + 5;
pair<int, int> go[maxn];
long long best;
vector<int> tree[(1 << 18)];
double inf = 1000.0 * 1000.0 * 1000.0;
inline double f(int x, int y) {
  if (go[y].first == go[x].first) return -inf;
  double s =
      (go[x].second - go[y].second) / (double)(go[y].first - go[x].first);
  return s;
}
void build(int i, int l, int r) {
  if (r - l == 1)
    tree[i] = {l};
  else {
    int m = (r + l) / 2;
    build(2 * i + 1, l, m);
    build(2 * i + 2, m, r);
    vector<int> t;
    int ptr_l = 0, ptr_r = 0;
    while (ptr_l < (int)tree[2 * i + 1].size() &&
           ptr_r < (int)tree[2 * i + 2].size()) {
      if (go[tree[2 * i + 1][ptr_l]] < go[tree[2 * i + 2][ptr_r]])
        t.push_back(tree[2 * i + 1][ptr_l++]);
      else
        t.push_back(tree[2 * i + 2][ptr_r++]);
    }
    while (ptr_l < (int)tree[2 * i + 1].size())
      t.push_back(tree[2 * i + 1][ptr_l++]);
    while (ptr_r < (int)tree[2 * i + 2].size())
      t.push_back(tree[2 * i + 2][ptr_r++]);
    for (auto key : t) {
      while (tree[i].size() > 1) {
        double was = f(tree[i][(int)tree[i].size() - 1],
                       tree[i][(int)tree[i].size() - 2]),
               now = f(key, tree[i].back());
        if (now <= was)
          tree[i].pop_back();
        else
          break;
      }
      if ((int)tree[i].size() == 1) {
        if (go[key].second >= go[tree[i][0]].second) tree[i].pop_back();
      }
      tree[i].push_back(key);
    }
  }
}
int get(int i, int l, int r, int lq, int rq, int t) {
  if (lq >= r || l >= rq) return -1;
  if (lq <= l && r <= rq) {
    int lef = 0, righ = (int)tree[i].size();
    while (righ - lef > 1) {
      int mid = (righ + lef) / 2;
      if (f(tree[i][mid - 1], tree[i][mid]) <= t)
        lef = mid;
      else
        righ = mid;
    }
    long long cur = (long long)go[tree[i][lef]].first * (long long)t +
                    (long long)go[tree[i][lef]].second;
    if (cur > best) {
      best = cur;
      return tree[i][lef];
    }
    return -1;
  }
  int m = (r + l) / 2, ans1 = get(2 * i + 1, l, m, lq, rq, t),
      ans2 = get(2 * i + 2, m, r, lq, rq, t);
  if (ans2 != -1) return ans2;
  return ans1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, q, l, r, t;
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) cin >> go[i].second >> go[i].first;
  build(0, 1, n + 1);
  for (int i = 1; i <= q; ++i) {
    cin >> l >> r >> t;
    best = 0;
    cout << get(0, 1, n + 1, l, r + 1, t) << '\n';
  }
  return 0;
}
