Problem: The company X has n employees numbered from 1 through n. Each employee u has a direct boss p_u (1 ≤ p_u ≤ n), except for the employee 1 who has no boss. It is guaranteed, that values p_i form a tree. Employee u is said to be in charge of employee v if u is the direct boss of v or there is an employee w such that w is in charge of v and u is the direct boss of w. Also, any employee is considered to be in charge of himself.

In addition, for each employee u we define it's level lv(u) as follow: 

  * lv(1)=0 
  * lv(u)=lv(p_u)+1 for u ≠ 1 



In the near future, there are q possible plans for the company to operate. The i-th plan consists of two integers l_i and r_i, meaning that all the employees in the range [l_i, r_i], and only they, are involved in this plan. To operate the plan smoothly, there must be a project manager who is an employee in charge of all the involved employees. To be precise, if an employee u is chosen as the project manager for the i-th plan then for every employee v ∈ [l_i, r_i], u must be in charge of v. Note, that u is not necessary in the range [l_i, r_i]. Also, u is always chosen in such a way that lv(u) is as large as possible (the higher the level is, the lower the salary that the company has to pay the employee).

Before any plan is operated, the company has JATC take a look at their plans. After a glance, he tells the company that for every plan, it's possible to reduce the number of the involved employees exactly by one without affecting the plan. Being greedy, the company asks JATC which employee they should kick out of the plan so that the level of the project manager required is as large as possible. JATC has already figured out the answer and challenges you to do the same.

Input

The first line contains two integers n and q (2 ≤ n ≤ 100 000, 1 ≤ q ≤ 100 000) — the number of employees and the number of plans, respectively.

The second line contains n-1 integers p_2, p_3, ..., p_n (1 ≤ p_i ≤ n) meaning p_i is the direct boss of employee i.

It is guaranteed, that values p_i form a directed tree with the root of 1.

Each of the following q lines contains two integers l_i and r_i (1 ≤ l_i<r_i ≤ n) — the range of the employees, involved in the corresponding plan.

Output

Print q lines, each containing two integers — the number of the employee which should be kicked from the corresponding plan and the maximum possible level of the project manager in that case.

If there are more than one way to choose that employee, print any of them.

Example

Input

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


Output

4 1
8 1
1 0
11 3
8 1

Note

In the example: 

<image> In the first query, we can choose whether 4 or 5 or 6 and the project manager will be 3.

In the second query, if we choose any employee other than the employee 8, the project manager will be 1. If we choose 8, the project manager will be 3. Since lv(3)=1 > lv(1)=0, choosing 8 is the best strategy.

In the third query, no matter how we choose the employee, the project manager will always be 1.

In the fourth query, if we choose 9 or 10 then the project manager will be 3. If we choose 11 then the project manager will be 7. Since lv(7)=3>lv(3)=1, we choose 11 as the answer.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7fffffff;
const double eps = 1e-10;
const double pi = acos(-1.0);
inline int read() {
  int x = 0, f = 1;
  char ch;
  ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = 0;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch & 15);
    ch = getchar();
  }
  if (f)
    return x;
  else
    return -x;
}
const int N = 100010;
int n, m, fa[18][N], Min[18][N], Max[18][N];
int head[N], p;
struct ss {
  int v, last;
} G[N << 1];
void add(int a, int b) {
  G[++p] = (ss){b, head[a]};
  head[a] = p;
  G[++p] = (ss){a, head[b]};
  head[b] = p;
}
int sta[N], pos[N], cnt, dep[N];
void dfs(int x) {
  pos[x] = ++cnt;
  sta[cnt] = x;
  for (int i = 1; i < 17; i++) fa[i][x] = fa[i - 1][fa[i - 1][x]];
  for (int i = head[x]; i; i = G[i].last)
    if (G[i].v != fa[0][x]) dep[G[i].v] = dep[x] + 1, dfs(G[i].v);
}
inline int min_pos(const int &x, const int &y) {
  if (pos[x] < pos[y]) return x;
  return y;
}
inline int max_pos(const int &x, const int &y) {
  if (pos[x] > pos[y]) return x;
  return y;
}
int lca(int x, int y) {
  if (dep[x] < dep[y]) swap(x, y);
  for (int i = dep[x] - dep[y]; i; i &= i - 1) x = fa[__builtin_ctz(i)][x];
  for (int i = 16; ~i; i--)
    if (fa[i][x] != fa[i][y]) x = fa[i][x], y = fa[i][y];
  return x == y ? x : fa[0][x];
}
int find_max(int l, int r) {
  int k = 31 - __builtin_clz(r - l + 1);
  return max_pos(Max[k][l], Max[k][r - (1 << k) + 1]);
}
int find_min(int l, int r) {
  int k = 31 - __builtin_clz(r - l + 1);
  return min_pos(Min[k][l], Min[k][r - (1 << k) + 1]);
}
int find_max_P(int l, int r, int p) {
  if (p == l)
    return find_max(p + 1, r);
  else if (p == r)
    return find_max(l, p - 1);
  else
    return max_pos(find_max(l, p - 1), find_max(p + 1, r));
}
int find_min_P(int l, int r, int p) {
  if (p == l)
    return find_min(p + 1, r);
  else if (p == r)
    return find_min(l, p - 1);
  else
    return min_pos(find_min(l, p - 1), find_min(p + 1, r));
}
int main() {
  n = read();
  m = read();
  for (int i = 2; i <= n; i++) fa[0][i] = read(), add(fa[0][i], i);
  dfs(1);
  for (int i = 1; i <= n; i++) Min[0][i] = Max[0][i] = i;
  for (int i = 1; i < 17; i++)
    for (int j = 1; j <= n - (1 << i) + 1; j++)
      Min[i][j] = min_pos(Min[i - 1][j], Min[i - 1][j + (1 << i - 1)]),
      Max[i][j] = max_pos(Max[i - 1][j], Max[i - 1][j + (1 << i - 1)]);
  while (m--) {
    int l = read(), r = read();
    int maxx = find_max(l, r), minx = find_min(l, r);
    int R1 = lca(minx, find_max_P(l, r, maxx)),
        R2 = lca(maxx, find_min_P(l, r, minx));
    if (dep[R1] > dep[R2])
      printf("%d %d\n", maxx, dep[R1]);
    else
      printf("%d %d\n", minx, dep[R2]);
  }
  return 0;
}