Problem: Alice and Bob are well-known for sending messages to each other. This time you have a rooted tree with Bob standing in the root node and copies of Alice standing in each of the other vertices. The root node has number 0, the rest are numbered 1 through n.

At some moments of time some copies of Alice want to send a message to Bob and receive an answer. We will call this copy the initiator. The process of sending a message contains several steps: 

  * The initiator sends the message to the person standing in the parent node and begins waiting for the answer. 
  * When some copy of Alice receives a message from some of her children nodes, she sends the message to the person standing in the parent node and begins waiting for the answer. 
  * When Bob receives a message from some of his child nodes, he immediately sends the answer to the child node where the message came from. 
  * When some copy of Alice (except for initiator) receives an answer she is waiting for, she immediately sends it to the child vertex where the message came from. 
  * When the initiator receives the answer she is waiting for, she doesn't send it to anybody. 
  * There is a special case: a copy of Alice can't wait for two answers at the same time, so if some copy of Alice receives a message from her child node while she already waits for some answer, she rejects the message and sends a message saying this back to the child node where the message came from. Then the copy of Alice in the child vertex processes this answer as if it was from Bob. 
  * The process of sending a message to a parent node or to a child node is instant but a receiver (a parent or a child) gets a message after 1 second. 



If some copy of Alice receives several messages from child nodes at the same moment while she isn't waiting for an answer, she processes the message from the initiator with the smallest number and rejects all the rest. If some copy of Alice receives messages from children nodes and also receives the answer she is waiting for at the same instant, then Alice first processes the answer, then immediately continue as normal with the incoming messages.

You are given the moments of time when some copy of Alice becomes the initiator and sends a message to Bob. For each message, find the moment of time when the answer (either from Bob or some copy of Alice) will be received by the initiator.

You can assume that if Alice wants to send a message (i.e. become the initiator) while waiting for some answer, she immediately rejects the message and receives an answer from herself in no time.

Input

The first line of input contains two integers n and m (1 ≤ n, m ≤ 200 000) — the number of nodes with Alices and the number of messages.

Second line contains n integers p1, p2, ..., pn (0 ≤ pi < i). The integer pi is the number of the parent node of node i.

The next m lines describe the messages. The i-th of them contains two integers xi and ti (1 ≤ xi ≤ n, 1 ≤ ti ≤ 109) — the number of the vertex of the initiator of the i-th message and the time of the initiation (in seconds). The messages are given in order of increasing initiation time (i.e. ti + 1 ≥ ti holds for 1 ≤ i < m). The pairs (xi, ti) are distinct.

Output

Print m integers — the i-th of them is the moment of time when the answer for the i-th message will be received by the initiator.

Examples

Input

6 3
0 1 2 3 2 5
4 6
6 9
5 11


Output

14 13 11 

Input

3 2
0 1 1
2 1
3 1


Output

5 3 

Input

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


Output

7 6 11 

Note

In the first example the first message is initiated at the moment 6, reaches Bob at the moment 10, and the answer reaches the initiator at the moment 14. The second message reaches vertex 2 at the moment 11. At this moment the copy of Alice in this vertex is still waiting for the answer for the first message, so she rejects the second message. The answer reaches the initiator at the moment 13. The third message is not sent at all, because at the moment 11 Alice in vertex 5 is waiting for the answer for the second message.

In the second example the first message reaches Bob, the second is rejected by Alice in vertex 1. This is because the message with smaller initiator number has the priority.

In the third example the first and the third messages reach Bob, while the second message is rejected by Alice in vertex 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
inline int max(int x, int y) { return x > y ? x : y; }
struct request {
  int node, time, id;
} p[200001];
int N, M, J[18][200001],
    *fa = J[0], dep[200001], ALL_LOG, head[200001], next[200001], size[200001],
    son[200001], left[200001], right[200001], top[200001], ref[200002],
    q[200002], ue[200002], T[524289], SIZE[524289], TAG[524289], LEFT[524289],
    GAP[524289], ANS[200001];
inline bool operator<(const request &a, const request &b) {
  return a.time + dep[a.node] < b.time + dep[b.node] ||
         a.time + dep[a.node] == b.time + dep[b.node] && a.node < b.node;
}
void READ() {
  scanf("%d%d", &N, &M);
  for (int i = 1; i <= N; i++) {
    scanf("%d", fa + i);
    dep[i] = dep[fa[i]] + 1;
    next[i] = head[fa[i]], head[fa[i]] = i;
  }
  while (2 << ALL_LOG < N) ALL_LOG++;
  for (int i = 1; i <= ALL_LOG; i++)
    for (int j = 1; j <= N; j++) J[i][j] = J[i - 1][J[i - 1][j]];
  for (int i = 1; i <= M; i++) {
    scanf("%d%d", &p[i].node, &p[i].time);
    p[i].id = i;
  }
  std::sort(p + 1, p + M + 1);
}
void BFSDFS() {
  int *H = q, *T = q + 1;
  q[1] = 0;
  while (H < T)
    for (int u = *++H, e = head[u]; e; e = next[e]) *++T = e;
  for (int i = N + 1; i > 1; i--) {
    size[fa[q[i]]] += ++size[q[i]];
    if (!son[fa[q[i]]] || size[q[i]] > size[son[fa[q[i]]]])
      son[fa[q[i]]] = q[i];
  }
  size[0]++;
  q[1] = 0, ue[1] = head[0];
  top[0] = 0;
  int D = 1, TIME = 1;
  left[0] = right[0] = 1;
  ref[1] = 0;
  top[0] = 0;
  while (D)
    if (son[q[D]] && !left[son[q[D]]]) {
      int To = son[q[D]];
      ref[left[To] = right[To] = ++TIME] = To;
      top[To] = top[q[D]];
      q[++D] = To, ue[D] = head[To];
    } else {
      if (ue[D] && ue[D] == son[q[D]]) ue[D] = next[ue[D]];
      if (ue[D]) {
        int To = ue[D];
        ue[D] = next[ue[D]];
        ref[left[To] = right[To] = ++TIME] = To;
        top[To] = To;
        q[++D] = To, ue[D] = head[To];
      } else {
        if (D > 1) right[q[D - 1]] = right[q[D]];
        D--;
      }
    }
}
void TREEinit(int p, int l, int r) {
  SIZE[p] = r - l + 1;
  if (l < r) {
    int m = l + r >> 1;
    TREEinit(p << 1, l, m);
    TREEinit(p << 1 | 1, m + 1, r);
  }
}
inline void EAT(int p, int left, int gap) {
  LEFT[p] = left;
  GAP[p] = gap;
  TAG[p] = 1;
  T[p] = gap >= 0 ? left + (SIZE[p] - 1) * gap : left;
}
inline void DOWN(int p) {
  if (TAG[p]) {
    EAT(p << 1, LEFT[p], GAP[p]);
    EAT(p << 1 | 1, LEFT[p] + SIZE[p << 1] * GAP[p], GAP[p]);
    TAG[p] = 0;
  }
}
inline void UP(int p) { T[p] = max(T[p << 1], T[p << 1 | 1]); }
void COVER(int p, int l, int r, int L, int R, int LEFT, int GAP) {
  if (l == L && r == R)
    EAT(p, LEFT, GAP);
  else {
    int m = l + r >> 1;
    DOWN(p);
    if (R <= m)
      COVER(p << 1, l, m, L, R, LEFT, GAP);
    else if (L > m)
      COVER(p << 1 | 1, m + 1, r, L, R, LEFT, GAP);
    else {
      COVER(p << 1, l, m, L, m, LEFT, GAP);
      COVER(p << 1 | 1, m + 1, r, m + 1, R, LEFT + GAP * (m - L + 1), GAP);
    }
    UP(p);
  }
}
int GET(int p, int l, int r, int L, int R) {
  if (L <= l && r <= R) return T[p];
  int m = l + r >> 1;
  DOWN(p);
  if (R <= m)
    return GET(p << 1, l, m, L, R);
  else if (L > m)
    return GET(p << 1 | 1, m + 1, r, L, R);
  else
    return max(GET(p << 1, l, m, L, R), GET(p << 1 | 1, m + 1, r, L, R));
}
void ANSWER(int id, int node, int time) {
  int target = node;
  while (GET(1, 1, N + 1, left[top[target]], left[target]) <= time + dep[node])
    target = fa[top[target]];
  int MAXDEP = dep[target] - dep[top[target]] + 1, LOG = 1;
  while (2 << LOG <= MAXDEP) LOG++;
  for (int i = LOG; ~i; i--)
    if (GET(1, 1, N + 1, left[target] - (1 << i) + 1, left[target]) <=
        time + dep[node])
      target = J[i][target];
  ANS[id] = time + (dep[node] - dep[target] << 1);
  int changed = node;
  while (top[changed] != top[target]) {
    COVER(1, 1, N + 1, left[top[changed]], left[changed],
          time + dep[node] + (dep[top[changed]] - dep[target] << 1), 2);
    changed = fa[top[changed]];
  }
  if (changed != target)
    COVER(1, 1, N + 1, left[target] + 1, left[changed], time + dep[node] + 2,
          2);
}
int main() {
  READ();
  BFSDFS();
  TREEinit(1, 1, N + 1);
  COVER(1, 1, N + 1, 1, 1, 2000000000, 0);
  for (int i = 1; i <= M; i++) ANSWER(p[i].id, p[i].node, p[i].time);
  for (int i = 1; i <= M; i++) printf("%d%c", ANS[i], " \n"[i == M]);
  return 0;
}