Your friend wants to quiz you. You are given a rooted tree with $n$ nodes, numbered from $1$ to $n$. For every node $i$, its parent is node $p_i$, except for the root (the node without a parent) which has $p_i = 0$. Node $u$ is an ancestor of node $v$ if either $u = v$, or node $u$ is an ancestor of the parent of node $v$ (if it exists).</p>

We say that node $z$ is a common ancestor of nodes $x$ and $y$ if node $z$ is an ancestor of both nodes $x$ and $y$. We say that node $z$ is the lowest common ancestor of nodes $x$ and $y$ if it is a common ancestor of nodes $x$ and $y$, and every common ancestor of nodes $x$ and $y$ is also an ancestor of node $z$. We denote the lowest common ancestor of nodes $x$ and $y$ by $LCA(x, y)$. In particular, $LCA(x, x) = x$.

Your friend would like to run the following pseudocode:

let L be an empty array
for x = 1 to n
  for y = 1 to n
    append ((x - 1)  n  n + (LCA(x, y) - 1) * n + (y - 1)) to L
sort L in non-decreasing order

Your friend has $q$ questions, numbered from $1$ to $q$. In question $j$, you are given an integer $k_j$ and asked to find the $k_j$-th element of the array $L$. Note that $L$ is $1$-indexed, so the indices range from $1$ to $n^2$, inclusive. To pass the quiz, you have to answer all of the questions.

입력 형식

The first line of input contains two integers $n$ and $q$ ($1 ≤ n ≤ 100\, 000$; $1 ≤ q ≤ 100\, 000$). The second line contains $n$ integers $p_1, p_2, \dots , p_n$ ($0 ≤ p_i ≤ n$ for all $i$). It is guaranteed that the given values represent a rooted tree. Each of the next $q$ lines contains an integer. The $j$-th line contains $k_j$ ($1 ≤ k_j ≤ n^2$).

출력 형식

For each question in order, output an integer representing the answer to the question.

예제 입력

5 3
3 0 2 2 3
1
18
25

예제 출력

0
82
124