In this problem you will have to help Berland army with organizing their command delivery system.

There are $n$ officers in Berland army. The first officer is the commander of the army, and he does not have any superiors. Every other officer has exactly one direct superior. If officer $a$ is the direct superior of officer $b$, then we also can say that officer $b$ is a direct subordinate of officer $a$.

Officer $x$ is considered to be a subordinate (direct or indirect) of officer $y$ if one of the following conditions holds:  officer $y$ is the direct superior of officer $x$;  the direct superior of officer $x$ is a subordinate of officer $y$. 

For example, on the picture below the subordinates of the officer $3$ are: $5, 6, 7, 8, 9$.

The structure of Berland army is organized in such a way that every officer, except for the commander, is a subordinate of the commander of the army.

Formally, let's represent Berland army as a tree consisting of $n$ vertices, in which vertex $u$ corresponds to officer $u$. The parent of vertex $u$ corresponds to the direct superior of officer $u$. The root (which has index $1$) corresponds to the commander of the army.

Berland War Ministry has ordered you to give answers on $q$ queries, the $i$-th query is given as $(u_i, k_i)$, where $u_i$ is some officer, and $k_i$ is a positive integer.

To process the $i$-th query imagine how a command from $u_i$ spreads to the subordinates of $u_i$. Typical DFS (depth first search) algorithm is used here.

Suppose the current officer is $a$ and he spreads a command. Officer $a$ chooses $b$ — one of his direct subordinates (i.e. a child in the tree) who has not received this command yet. If there are many such direct subordinates, then $a$ chooses the one having minimal index. Officer $a$ gives a command to officer $b$. Afterwards, $b$ uses exactly the same algorithm to spread the command to its subtree. After $b$ finishes spreading the command, officer $a$ chooses the next direct subordinate again (using the same strategy). When officer $a$ cannot choose any direct subordinate who still hasn't received this command, officer $a$ finishes spreading the command.

Let's look at the following example: [Image] 

If officer $1$ spreads a command, officers receive it in the following order: $[1, 2, 3, 5 ,6, 8, 7, 9, 4]$.

If officer $3$ spreads a command, officers receive it in the following order: $[3, 5, 6, 8, 7, 9]$.

If officer $7$ spreads a command, officers receive it in the following order: $[7, 9]$.

If officer $9$ spreads a command, officers receive it in the following order: $[9]$.

To answer the $i$-th query $(u_i, k_i)$, construct a sequence which describes the order in which officers will receive the command if the $u_i$-th officer spreads it. Return the $k_i$-th element of the constructed list or -1 if there are fewer than $k_i$ elements in it.

You should process queries independently. A query doesn't affect the following queries.


-----Input-----

The first line of the input contains two integers $n$ and $q$ ($2 \le n \le 2 \cdot 10^5, 1 \le q \le 2 \cdot 10^5$) — the number of officers in Berland army and the number of queries.

The second line of the input contains $n - 1$ integers $p_2, p_3, \dots, p_n$ ($1 \le p_i < i$), where $p_i$ is the index of the direct superior of the officer having the index $i$. The commander has index $1$ and doesn't have any superiors.

The next $q$ lines describe the queries. The $i$-th query is given as a pair ($u_i, k_i$) ($1 \le u_i, k_i \le n$), where $u_i$ is the index of the officer which starts spreading a command, and $k_i$ is the index of the required officer in the command spreading sequence.


-----Output-----

Print $q$ numbers, where the $i$-th number is the officer at the position $k_i$ in the list which describes the order in which officers will receive the command if it starts spreading from officer $u_i$. Print "-1" if the number of officers which receive the command is less than $k_i$.

You should process queries independently. They do not affect each other.


-----Example-----
Input
9 6
1 1 1 3 5 3 5 7
3 1
1 5
3 4
7 3
1 8
1 9

Output
3
6
8
-1
9
4

Difficulty: MEDIUM_HARD

Solutions:
from sys import stdin
import bisect
input = stdin.readline
(n, q) = map(int, input().split())
t = [[] for i in range(n)]
p = list(map(int, input().split()))
for i in range(n - 1):
	t[p[i] - 1].append(i + 1)
	t[i + 1].append(p[i] - 1)
for i in range(n):
	t[i].sort(reverse=True)
vis = []
que = [(-1, 0)]
cnt = 0
p = [-1] + p
for i in range(1, n):
	p[i] -= 1
while que:
	(par, ver) = que.pop()
	vis.append(ver)
	for to in t[ver]:
		if par != to:
			que.append((ver, to))
size = [1] * n
for i in vis[1:][::-1]:
	size[p[i]] += size[i]
idx = [-1] * n
for i in range(n):
	idx[vis[i]] = i
for _ in range(q):
	(u, k) = map(int, input().split())
	if size[u - 1] < k:
		print(-1)
	else:
		print(vis[idx[u - 1] + k - 1] + 1)


import sys
from math import sqrt, gcd, ceil, log
from collections import defaultdict, Counter, deque
input = sys.stdin.readline
read = lambda : list(map(int, input().strip().split()))

def main():
	ans = []
	(n, q) = read()
	par = [0, 0] + read()
	adj = defaultdict(list)
	for i in range(2, n + 1):
		adj[par[i]].append(i)
	for i in adj:
		adj[i].sort(reverse=True)
	ord_arr = []
	order = defaultdict(int)
	stk = [1]
	while stk:
		node = stk.pop()
		ord_arr.append(node)
		order[node] = len(ord_arr)
		for child in adj[node]:
			if child != par[node]:
				stk.append(child)
	sub_tree = defaultdict(int)
	for i in range(n, 0, -1):
		sub_tree[i] += 1
		sub_tree[par[i]] += sub_tree[i]
	for i in range(q):
		(u, v) = read()
		if sub_tree[u] < v:
			ans.append(str(-1))
		else:
			ans.append(str(ord_arr[order[u] - 1 + v - 1]))
	print('\n'.join(ans))
main()


from collections import deque
import sys
input = sys.stdin.readline

def bfs():
	q = deque()
	q.append(1)
	p0 = []
	while q:
		i = q.popleft()
		p0.append(i)
		for j in G[i]:
			q.append(j)
	childcnt = [1] * (n + 1)
	while p0:
		i = p0.pop()
		if i == 1:
			break
		childcnt[p[i - 2]] += childcnt[i]
	return childcnt

def euler_tour():
	s = []
	s.append(1)
	now = [0] * (n + 1)
	t = 1
	(t1, t2) = ([-1] * (n + 1), [-1] * (n + 1))
	v = []
	while s:
		i = s[-1]
		if t1[i] == -1:
			v.append(i)
			t1[i] = t
			t += 1
		if now[i] == len(G[i]):
			t2[i] = t
			t += 1
			s.pop()
		else:
			s.append(G[i][now[i]])
			now[i] += 1
	return (t1, t2, v)
(n, q) = map(int, input().split())
p = list(map(int, input().split()))
G = [[] for _ in range(n + 1)]
for i in range(n - 1):
	G[p[i]].append(i + 2)
childcnt = bfs()
(t1, t2, v) = euler_tour()
r = dict()
for i in range(n):
	r[v[i]] = i
for _ in range(q):
	(u, k) = map(int, input().split())
	ans = -1 if childcnt[u] < k else v[r[u] + k - 1]
	print(ans)


(n, q) = [int(x) for x in input().split()]
L = [int(x) - 1 for x in input().split()]
G = []
for i in range(n):
	G.append([])
for i in range(n - 1):
	G[L[i]].append((i + 1, L[i]))
	G[i + 1].append((L[i], i + 1))
L = [-1] + L
G[0].reverse()
for t in range(1, n):
	G[t] = [G[t][0]] + list(reversed(G[t][1:]))
options = [(0, 0)]
visited = [0] * n
sub = [1] * n
path = []
while options:
	t = options.pop()
	if visited[t[0]] == 0:
		visited[t[0]] = 1
		path.append(t[0])
		options.extend(G[t[0]])
	elif visited[t[0]] == 1:
		sub[t[0]] += sub[t[1]]
Position = {}
for i in range(n):
	Position[path[i]] = i
for i in range(q):
	(u, k) = [int(x) for x in input().split()]
	if sub[u - 1] < k:
		print(-1)
	else:
		print(path[Position[u - 1] + k - 1] + 1)


(n, q) = map(int, input().split())
children = [[] for i in range(n)]
size = [0] * n
for (i, p) in enumerate(map(int, input().split()), 1):
	children[p - 1].append(i)
size = [1] * n
dfs = []
index_to_rank = [0] * n

def traverse():
	visited = [False] * n
	stack = [(0, None)]
	while stack:
		(i, parent) = stack[-1]
		if visited[i]:
			stack.pop()
			if parent is not None:
				size[parent] += size[i]
		else:
			visited[i] = True
			index_to_rank[i] = len(dfs)
			dfs.append(i)
			for j in reversed(children[i]):
				stack.append((j, i))
answer = []

def answer_queries():
	print = answer.append
	for i in range(q):
		(u, k) = map(int, input().split())
		index = u - 1
		if size[index] < k:
			print(-1)
		else:
			print(dfs[index_to_rank[index] + k - 1] + 1)
traverse()
answer_queries()
print('\n'.join(map(str, answer)))


import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
from queue import PriorityQueue
import sys
sys.setrecursionlimit(200010)

class Graph:

	def __init__(self, n):
		self.graph = defaultdict(lambda : [])
		self.vertices = n
		self.edges = 0
		self.toposorted = []

	def addEdge(self, a, b):
		self.graph[a].append(b)
		self.edges += 1

	def cycleUntill(self, visited, curr, parent):
		visited[curr] = True
		for i in self.graph[curr]:
			if not visited[i]:
				if self.cycleUntill(visited, i, curr):
					return True
			elif i != parent:
				return True
		return False

	def cycle(self):
		n = self.vertices
		visited = [False] * (n + 2)
		for i in range(1, n + 1):
			if not visited[i]:
				if self.cycleUntill(visited, i, -1):
					return True
		return False

	def topologicalSort(self):
		in_degree = [0] * (self.vertices + 10)
		for i in self.graph:
			for j in self.graph[i]:
				in_degree[j] += 1
		queue = deque()
		for i in range(1, self.vertices + 1):
			if in_degree[i] == 0:
				queue.append(i)
		cnt = 0
		while queue:
			u = queue.popleft()
			self.toposorted.append(u)
			for i in self.graph[u]:
				in_degree[i] -= 1
				if in_degree[i] == 0:
					queue.append(i)
			cnt += 1
		if cnt != self.vertices:
			return False
		else:
			return True

	def connected(self):
		visited = [False] * (self.vertices + 2)
		ans = []
		for i in range(1, self.vertices + 1):
			if not visited[i]:
				comp = []
				q = deque()
				visited[i] = True
				q.append(i)
				while len(q) > 0:
					temp = q.popleft()
					comp.append(temp)
					for j in self.graph[temp]:
						if not visited[j]:
							visited[j] = True
							q.append(j)
				ans.append(comp)
		return ans

def find(curr):
	q = deque()
	q.append(1)
	while len(q) > 0:
		temp = q.pop()
		dfs.append(temp)
		for i in graph[temp]:
			q.append(i)
	for i in dfs[::-1]:
		if parent[i] != -1:
			subtree[parent[i]] += subtree[i]
(n, q) = map(int, stdin.readline().split())
a = list(map(int, stdin.readline().split()))
parent = [-1] * (n + 2)
graph = defaultdict(lambda : [])
for i in range(n - 1):
	parent[i + 2] = a[i]
	graph[a[i]].append(i + 2)
subtree = [1] * (n + 2)
for i in graph:
	graph[i].sort(reverse=True)
dfs = []
find(1)
index = defaultdict(lambda : -1)
for i in range(n):
	index[dfs[i]] = i
for _ in range(q):
	(u, k) = map(int, stdin.readline().split())
	if k > subtree[u]:
		print(-1)
	else:
		print(dfs[index[u] + k - 1])


import re
import sys
exit = sys.exit
from bisect import bisect_left as bsl, bisect_right as bsr
from collections import Counter, defaultdict as ddict, deque
from functools import lru_cache
cache = lru_cache(None)
from heapq import *
from itertools import *
from math import inf
from pprint import pprint as pp
enum = enumerate
ri = lambda : int(rln())
ris = lambda : list(map(int, rfs()))
rln = sys.stdin.readline
rl = lambda : rln().rstrip('\n')
rfs = lambda : rln().split()
mod = 1000000007
d4 = [(0, -1), (1, 0), (0, 1), (-1, 0)]
d8 = [(-1, -1), (0, -1), (1, -1), (-1, 0), (1, 0), (-1, 1), (0, 1), (1, 1)]

def main():
	(n, q) = ris()
	p = ris()
	adj = [[] for _ in range(n + 1)]
	for (u, up) in enum(p, start=2):
		adj[up].append(u)
	a = [0]
	b = [0] * (n + 1)
	c = [0] * (n + 1)

	def dfs(u):
		b[u] = len(a)
		a.append(u)
		cc = 0
		for v in sorted(adj[u]):
			cc += dfs(v)
		c[u] = cc
		return 1 + cc
	dfs(1)
	for _ in range(q):
		(u, k) = ris()
		k -= 1
		if c[u] < k:
			print(-1)
		else:
			print(a[b[u] + k])
import threading
sys.setrecursionlimit(10 ** 6)
threading.stack_size(10 ** 8)
t = threading.Thread(target=main)
t.start()
t.join()


(n, q) = map(int, input().split())
g = [[] for i in range(n + 1)]
p = list(map(int, input().split()))
for i in range(n - 1):
	g[p[i]].append(i + 2)
timer = 0
children = [0] * (n + 1)
when = [0] * (n + 1)
a = []
instack = [0] * (n + 1)
stack = [1]
while stack:
	u = stack[-1]
	if instack[u] == 1:
		children[u] = len(a) - when[u]
		stack.pop()
		continue
	a.append(u)
	when[u] = len(a) - 1
	instack[u] = 1
	for i in reversed(g[u]):
		stack.append(i)
ans = [0] * q
for i in range(q):
	(x, y) = map(int, input().split())
	y -= 1
	ans[i] = '-1' if y >= children[x] else str(a[when[x] + y])
print('\n'.join(ans))


import re
import sys
exit = sys.exit
from bisect import bisect_left as bsl, bisect_right as bsr
from collections import Counter, defaultdict as ddict, deque
from functools import lru_cache
cache = lru_cache(None)
from heapq import *
from itertools import *
from math import inf
from pprint import pprint as pp
enum = enumerate
ri = lambda : int(rln())
ris = lambda : list(map(int, rfs()))
rln = sys.stdin.readline
rl = lambda : rln().rstrip('\n')
rfs = lambda : rln().split()
mod = 1000000007
d4 = [(0, -1), (1, 0), (0, 1), (-1, 0)]
d8 = [(-1, -1), (0, -1), (1, -1), (-1, 0), (1, 0), (-1, 1), (0, 1), (1, 1)]
(n, q) = ris()
p = ris()
adj = [[] for _ in range(n + 1)]
for (u, up) in enum(p):
	adj[up].append(2 + u)
p = [0, 0] + p
path = [0]
start = [0] * (n + 1)
stk = [1]
while stk:
	u = stk.pop()
	start[u] = len(path)
	path.append(u)
	for v in reversed(adj[u]):
		stk.append(v)
size = [0] * (n + 1)
for i in range(n, 1, -1):
	size[p[i]] += 1 + size[i]
for _ in range(q):
	(u, k) = ris()
	k -= 1
	if size[u] < k:
		print(-1)
	else:
		print(path[start[u] + k])


(n, q) = list(map(int, input().split()))
officers = list(map(int, input().split()))
s = [[] for _ in range(n)]
c = [1] * n
b = [0] * n
for (i, v) in enumerate(officers):
	s[v - 1].append(i + 1)
traversal = []

def dfs():
	stack = [0]
	while stack:
		n = stack.pop()
		traversal.append(n)
		for child in reversed(s[n]):
			stack.append(child)
dfs()
for i in range(n):
	b[traversal[i]] = i
for i in range(n - 1, -1, -1):
	for child in s[i]:
		c[i] += c[child]
answer = []
for _ in range(q):
	(u, k) = list(map(int, input().split()))
	start = b[u - 1]
	if k <= c[u - 1]:
		answer.append(str(traversal[start + k - 1] + 1))
	else:
		answer.append('-1')
print('\n'.join(answer))


(n, q) = [int(x) for x in input().split()]
parent = [-1] + [int(x) - 1 for x in input().split()]
start = [0] * n
end = [1] * n
size = [1] * n
path = [0] * n
for i in range(n - 1, 0, -1):
	size[parent[i]] += size[i]
for v in range(1, n):
	start[v] = end[parent[v]]
	end[v] = start[v] + 1
	end[parent[v]] += size[v]
	path[start[v]] = v
for j in range(q):
	(u, k) = [int(x) - 1 for x in input().split()]
	if k >= size[u]:
		print('-1')
	else:
		print(path[start[u] + k] + 1)


(n, q) = map(int, input().split())
par = [int(v) - 1 for v in input().split()]
chs = [[] for i in range(n)]
for (i, p) in enumerate(par):
	chs[p].append(i + 1)
vis = [0 for _ in range(n)]
bel = [1 for _ in range(n)]
stack = [0]
order = [0]
while stack:
	v = stack[-1]
	if len(chs[v]) == vis[v]:
		if v != 0:
			bel[par[v - 1]] += bel[v]
		stack.pop()
		continue
	ch = chs[v][vis[v]]
	vis[v] += 1
	order.append(ch)
	stack.append(ch)
FST = {}
for (i, c) in enumerate(order):
	FST[c] = i
out = []
for _ in range(q):
	(u, k) = map(lambda x: int(x) - 1, input().split())
	if k >= bel[u]:
		out.append(-1)
	else:
		out.append(order[FST[u] + k] + 1)
print('\n'.join(map(str, out)))


import sys
input = sys.stdin.readline
from collections import deque

class Graph(object):

	def __init__(self, n, d):
		self.n = n
		self.graph = [[] for i in range(n)]
		self.parent = [-1 for i in range(n)]
		self.directed = d

	def addEdge(self, x, y):
		self.graph[x].append(y)
		if not self.directed:
			self.graph[y].append(x)

	def bfs(self, root):
		self.parent = [-1 for i in range(self.n)]
		queue = [root]
		queue = deque(queue)
		vis = [0] * self.n
		while len(queue) != 0:
			element = queue.popleft()
			vis[element] = 1
			for i in self.graph[element]:
				if vis[i] == 0:
					queue.append(i)
					self.parent[i] = element

	def dfs(self, root, ans):
		stack = [root]
		vis = [0] * self.n
		stack2 = []
		while len(stack) != 0:
			element = stack.pop()
			order.append(element)
			if vis[element]:
				continue
			vis[element] = 1
			stack2.append(element)
			temp = []
			for i in self.graph[element]:
				if vis[i] == 0:
					temp.append(i)
			temp.sort(reverse=True)
			for i in temp:
				stack.append(i)
		while len(stack2) != 0:
			element = stack2.pop()
			m = 0
			for i in self.graph[element]:
				if i != self.parent[element]:
					m += ans[i]
			ans[element] = m + 1
		return ans

	def shortestpath(self, source, dest):
		self.bfs(source)
		path = [dest]
		while self.parent[path[-1]] != -1:
			path.append(parent[path[-1]])
		return path[::-1]

	def ifcycle(self):
		self.bfs(0)
		queue = [0]
		vis = [0] * n
		queue = deque(queue)
		while len(queue) != 0:
			element = queue.popleft()
			vis[element] = 1
			for i in graph[element]:
				if vis[i] == 1 and i != parent[element]:
					return True
				if vis[i] == 0:
					queue.append(i)
					vis[i] = 1
		return False

	def reroot(self, root, ans):
		stack = [root]
		vis = [0] * n
		while len(stack) != 0:
			e = stack[-1]
			if vis[e]:
				stack.pop()
				continue
			vis[e] = 1
			for i in graph[e]:
				if not vis[e]:
					stack.append(i)
			if self.parent[e] == -1:
				continue
(n, q) = list(map(int, input().split()))
g = Graph(n, False)
g.parent = [-1] + list(map(int, input().split()))
for i in range(1, n):
	g.parent[i] -= 1
	g.addEdge(g.parent[i], i)
count = [0] * n
order = []
g.dfs(0, count)
rank = {}
for i in range(n):
	rank[order[i]] = i
for i in range(q):
	(a, k) = list(map(int, input().split()))
	if k > count[a - 1]:
		print(-1)
	else:
		print(order[rank[a - 1] + k - 1] + 1)


from sys import stdin, stdout
from math import gcd, sqrt, factorial, pi, inf
from collections import deque, defaultdict
from bisect import bisect, bisect_left
from itertools import permutations as per
input = stdin.readline
R = lambda : map(int, input().split())
I = lambda : int(input())
S = lambda : input().rstrip('\n')
L = lambda : list(R())
P = lambda x: stdout.write(str(x) + '\n')
nCr = lambda x, y: f[x] * inv(f[y] * f[x - y] % N) % N
(n, m) = R()
a = L()
v = [[] for i in range(n)]
for i in range(n - 2, -1, -1):
	v[a[i] - 1] += (i + 1,)
s = []
stk = [0]
while stk:
	p = stk.pop()
	s += (p,)
	for i in v[p]:
		stk += (i,)
val = [1] * n
for i in s[1:][::-1]:
	val[a[i - 1] - 1] += val[i]
ind = [0] * n
for i in range(n):
	ind[s[i]] = i
for i in range(m):
	(x, y) = R()
	if val[x - 1] < y:
		print(-1)
	else:
		print(s[ind[x - 1] + y - 1] + 1)


from sys import stdin
input = lambda : stdin.readline().strip()
from math import ceil, sqrt, factorial, gcd
from collections import deque
(n, q) = map(int, input().split())
papa = list(map(int, input().split()))
status = [[-1, -1] for i in range(n + 1)]
graph = {i: [] for i in range(1, n + 1)}
for i in range(len(papa)):
	graph[papa[i]].append(i + 2)
for i in graph:
	graph[i] = sorted(graph[i], reverse=True)
stack = [1]
l = []
while stack:
	x = stack[-1]
	if len(graph[x]) == 0:
		status[x][1] = len(l)
		if status[x][0] == -1:
			l.append(x)
			status[x][0] = status[x][1]
		stack.pop()
	else:
		if status[x][0] == -1:
			status[x][0] = len(l)
			l.append(x)
		stack.append(graph[x].pop())
for i in range(q):
	(u, k) = map(int, input().split())
	k -= 1
	t = status[u][1] - status[u][0]
	if t == 0:
		if k == 0:
			print(u)
		else:
			print(-1)
	elif k >= t:
		print(-1)
	else:
		print(l[status[u][0] + k])


from collections import *
from sys import stdin
from bisect import *

def arr_inp(n):
	if n == 1:
		return [int(x) for x in stdin.readline().split()]
	elif n == 2:
		return [float(x) for x in stdin.readline().split()]
	else:
		return [str(x) for x in stdin.readline().split()]

class graph:

	def __init__(self, gdict=None):
		if gdict is None:
			gdict = defaultdict(list)
		self.gdict = gdict

	def add_edge(self, node1, node2):
		self.gdict[node1].append(node2)

	def dfsUtil(self, v):
		(stack, self.visit, out) = ([v], [0] * (n + 1), [])
		while stack:
			s = stack.pop()
			if not self.visit[s]:
				out.append(s)
				self.visit[s] = 1
			for i in sorted(self.gdict[s], reverse=True):
				if not self.visit[i]:
					stack.append(i)
		return out
(n, q) = arr_inp(1)
(p, g, mem, quary) = (arr_inp(1), graph(), [1 for i in range(n + 1)], defaultdict(lambda : -1))
for i in range(2, n + 1):
	g.add_edge(p[i - 2], i)
(all, ans) = (g.dfsUtil(1), [])
mem2 = {all[i]: i for i in range(n)}
for i in all[::-1]:
	for j in g.gdict[i]:
		mem[i] += mem[j]
for i in range(q):
	(u, v) = arr_inp(1)
	ans.append(str(-1 if mem[u] < v else all[mem2[u] + v - 1]))
print('\n'.join(ans))


import sys, os, io
from sys import stdin
from collections import defaultdict

def ii():
	return int(input())

def li():
	return list(map(int, input().split()))
from types import GeneratorType

def bootstrap(to, stack=[]):
	while True:
		if type(to) is GeneratorType:
			stack.append(to)
			to = next(to)
		else:
			stack.pop()
			if not stack:
				break
			to = stack[-1].send(to)
	return to
	return wrappedfunc
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
cnt = 1
d = defaultdict(lambda : 0)
travesal = []
subtreesize = defaultdict(lambda : 0)

def dfs(node, parent):
	global adj, cnt
	travesal.append(node)
	ans = 1
	for child in adj[node]:
		if child == parent:
			continue
		d[child] = cnt
		cnt += 1
		ans += (yield dfs(child, node))
	subtreesize[node] = ans
	yield ans
(n, q) = li()
p = li()
adj = [[] for i in range(200002)]
for i in range(len(p)):
	adj[i + 1].append(p[i] - 1)
	adj[p[i] - 1].append(i + 1)
bootstrap(dfs(0, -1))
for i in range(len(travesal)):
	travesal[i] += 1
for i in range(q):
	(u, k) = li()
	u -= 1
	dis = d[u]
	x = dis + k - 1
	if x >= len(travesal) or subtreesize[u] < k:
		print(-1)
	else:
		print(travesal[x])


(n, q) = map(int, input().split())
p = [-1] + [int(s) - 1 for s in input().split()]
o = [0] * n
l = [0] * n
s = [1] * n
v = [1] * n
for i in range(n - 1, 0, -1):
	s[p[i]] += s[i]
for i in range(1, n):
	l[i] = v[p[i]]
	v[p[i]] += s[i]
	o[l[i]] = i
	v[i] = l[i] + 1
res = [0] * q
for i in range(q):
	(u, k) = map(int, input().split())
	u -= 1
	k -= 1
	res[i] = str(o[l[u] + k] + 1 if k < s[u] else -1)
print('\n'.join(res))


import sys
readline = sys.stdin.readline

def getpar(Edge, p):
	N = len(Edge)
	par = [0] * N
	par[0] = -1
	par[p] - 1
	stack = [p]
	visited = set([p])
	while stack:
		vn = stack.pop()
		for vf in Edge[vn]:
			if vf in visited:
				continue
			visited.add(vf)
			par[vf] = vn
			stack.append(vf)
	return par

def topological_sort_tree(E, r):
	Q = [r]
	L = []
	visited = set([r])
	while Q:
		vn = Q.pop()
		L.append(vn)
		for vf in E[vn]:
			if vf not in visited:
				visited.add(vf)
				Q.append(vf)
	return L

def getcld(p):
	res = [[] for _ in range(len(p))]
	for (i, v) in enumerate(p[1:], 1):
		res[v].append(i)
	return res
(N, Q) = map(int, readline().split())
P = [-1] + list(map(lambda x: int(x) - 1, readline().split()))
Edge = [[] for _ in range(N)]
for i in range(1, N):
	Edge[i].append(P[i])
	Edge[P[i]].append(i)
P = getpar(Edge, 0)
L = topological_sort_tree(Edge, 0)
LL = []
stack = [0]
used = set()
Edge = [sorted(e, reverse=True) for e in Edge]
while stack:
	vn = stack.pop()
	if vn in used:
		continue
	LL.append(vn)
	used.add(vn)
	for vf in Edge[vn]:
		if vf not in used:
			stack.append(vf)
ix = [None] * N
for i in range(N):
	ix[LL[i]] = i
cc = [1] * N
for l in L[:0:-1]:
	p = P[l]
	cc[p] += cc[l]
Ans = [None] * Q
for qu in range(Q):
	(u, k) = map(int, readline().split())
	u -= 1
	k -= 1
	if cc[u] < k + 1:
		Ans[qu] = -1
		continue
	Ans[qu] = LL[ix[u] + k] + 1
print('\n'.join(map(str, Ans)))


from collections import deque

class CodeforcesTask1006ESolution:

	def __init__(self):
		self.result = ''
		self.n_q = []
		self.command = []
		self.queries = []

	def read_input(self):
		self.n_q = [int(x) for x in input().split(' ')]
		self.command = [int(x) for x in input().split(' ')]
		for _ in range(self.n_q[1]):
			self.queries.append([int(x) for x in input().split(' ')])

	def process_task(self):
		tree = [[] for _ in range(self.n_q[0])]
		for x in range(1, self.n_q[0]):
			tree[self.command[x - 1] - 1].append(x + 1)
		starts = {}
		stops = {}
		called = []
		to_visit = deque([1, -1])
		while to_visit:
			visiting = to_visit.popleft()
			if visiting < 0:
				stops[abs(visiting)] = len(called)
			else:
				called.append(visiting)
				starts[visiting] = len(called)
				n = sorted(tree[visiting - 1], reverse=True)
				to_visit.appendleft(-visiting)
				for a in n:
					to_visit.appendleft(a)
		ranges = [stops[x] - starts[x] + 1 for x in range(1, self.n_q[0] + 1)]
		for query in self.queries:
			if ranges[query[0] - 1] >= query[1]:
				print(called[starts[query[0]] + query[1] - 2])
			else:
				print('-1')

	def get_result(self):
		return self.result

def __starting_point():
	Solution = CodeforcesTask1006ESolution()
	Solution.read_input()
	Solution.process_task()
	print(Solution.get_result())
__starting_point()


import atexit, io, sys, collections, math, heapq, fractions, copy, os, functools
import sys
import random
import collections
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
(n, q) = map(int, input().split())
ais = list(map(int, input().split()))
adj = collections.defaultdict(list)
for u in range(n - 1):
	adj[ais[u] - 1].append(u + 1)
for u in adj:
	adj[u].sort()
size = [0 for u in range(n)]
r = []
h = {}

def dfs(u, r):
	stack = [u]
	while stack:
		u = stack[-1]
		if len(adj[u]) == 0:
			stack.pop()
			r.append(u)
			size[u] += 1
			if stack:
				size[stack[-1]] += size[u]
		else:
			v = adj[u].pop()
			stack.append(v)
dfs(0, r)
r = r[::-1]
for (i, v) in enumerate(r):
	if v not in h:
		h[v] = i
for _ in range(q):
	(u, k) = map(int, input().split())
	u -= 1
	if k - 1 < size[u]:
		print(r[h[u] + k - 1] + 1)
	else:
		print(-1)


import sys, os, io
from sys import stdin
from types import GeneratorType
from math import log, gcd, ceil
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_left, bisect_right
import math
alphabets = list('abcdefghijklmnopqrstuvwxyz')

def bootstrap(f, stack=[]):

	def wrappedfunc(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		else:
			to = f(*args, **kwargs)
			while True:
				if type(to) is GeneratorType:
					stack.append(to)
					to = next(to)
				else:
					stack.pop()
					if not stack:
						break
					to = stack[-1].send(to)
			return to
	return wrappedfunc

def ncr(n, r, p):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * pow(den, p - 2, p) % p

def primeFactors(n):
	l = []
	while n % 2 == 0:
		l.append(2)
		n = n / 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			l.append(int(i))
			n = n / i
	if n > 2:
		l.append(n)
	c = dict(Counter(l))
	return list(set(l))

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def sieveForSmallestPrimeFactor():
	MAXN = 100001
	spf = [0 for i in range(MAXN)]
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, math.ceil(math.sqrt(MAXN))):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i
	return spf

def getPrimeFactorizationLOGN(x):
	spf = sieveForSmallestPrimeFactor()
	ret = list()
	while x != 1:
		ret.append(spf[x])
		x = x // spf[x]
	return ret

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime

def si():
	return input()

def divideCeil(n, x):
	if n % x == 0:
		return n // x
	return n // x + 1

def ii():
	return int(input())

def li():
	return list(map(int, input().split()))
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
else:
	input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
cnt = 1
d = defaultdict(lambda : 0)
travesal = []
subtreesize = defaultdict(lambda : 0)

@bootstrap
def dfs(node, parent):
	global adj, cnt
	travesal.append(node)
	ans = 1
	for child in adj[node]:
		if child == parent:
			continue
		d[child] = cnt
		cnt += 1
		ans += (yield dfs(child, node))
	subtreesize[node] = ans
	yield ans
(n, q) = li()
p = li()
adj = [[] for i in range(200002)]
for i in range(len(p)):
	adj[i + 1].append(p[i] - 1)
	adj[p[i] - 1].append(i + 1)
dfs(0, -1)
for i in range(len(travesal)):
	travesal[i] += 1
for i in range(q):
	(u, k) = li()
	u -= 1
	dis = d[u]
	x = dis + k - 1
	if x >= len(travesal) or subtreesize[u] < k:
		print(-1)
	else:
		print(travesal[x])


import sys
from collections import defaultdict, deque
(n, q) = list(map(int, input().split()))
p = list(map(int, input().split()))
edge = defaultdict(list)
child = defaultdict(list)
for i in range(n - 1):
	edge[p[i]].append(i + 2)
	edge[i + 2].append(p[i])
for i in range(1, n + 1):
	edge[i].reverse()

def dfs(node):
	vis[node] = 1
	stack = [node]
	res = [-1, node]
	while stack:
		cur = stack.pop()
		res.append(cur)
		for j in edge[cur]:
			if vis[j] == 0:
				stack.append(j)
				vis[j] = 1
	return res

def bfs(node):
	vis[node] = 1
	q = deque([node])
	res = []
	while q:
		cur = q.popleft()
		res.append(cur)
		for j in edge[cur]:
			if vis[j] == 0:
				q.append(j)
				child[cur].append(j)
				vis[j] = 1
	res.reverse()
	return res
vis = [0] * (n + 1)
arr = dfs(1)
vis = [0] * (n + 1)
num = bfs(1)
subTreeSize = [1] * (n + 1)
for i in num:
	for j in child[i]:
		subTreeSize[i] += subTreeSize[j]
ind = [-1] * (n + 1)
for i in range(1, n + 1):
	ind[arr[i]] = i
for i in range(q):
	(u, k) = list(map(int, input().split()))
	if subTreeSize[u] < k:
		print(-1)
	else:
		print(arr[ind[u] + k - 1])


import sys
import io, os
input = sys.stdin.buffer.readline
(n, q) = map(int, input().split())
parent = list(map(int, input().split()))
UK = []
for i in range(q):
	(u, k) = map(int, input().split())
	(u, k) = (u - 1, k - 1)
	UK.append((u, k))
parent = [p - 1 for p in parent]
parent = [-1] + parent
g = [[] for _ in range(n)]
for (i, p) in enumerate(parent):
	if p == -1:
		continue
	else:
		g[p].append(i)
g = [list(reversed(l)) for l in g]
root = 0
s = [root]
order = []
left = [0] * n
right = [-1] * n
depth = [-1] * n
num = -1
de = -1
while s:
	q = s.pop()
	if q >= 0:
		num += 1
		order.append(q)
		left[q] = num
		right[q] = num
		s.append(~q)
		de += 1
		depth[q] = de
		for v in g[q]:
			s.append(v)
	else:
		de -= 1
		if ~q != root:
			order.append(parent[~q])
			num += 1
			right[parent[~q]] = num

class BIT:

	def __init__(self, n):
		self.n = n
		self.bit = [0] * (self.n + 1)

	def init(self, init_val):
		for (i, v) in enumerate(init_val):
			self.add(i, v)

	def add(self, i, x):
		i += 1
		while i <= self.n:
			self.bit[i] += x
			i += i & -i

	def sum(self, i, j):
		return self._sum(j) - self._sum(i)

	def _sum(self, i):
		res = 0
		while i > 0:
			res += self.bit[i]
			i -= i & -i
		return res

	def lower_bound(self, x):
		s = 0
		pos = 0
		depth = self.n.bit_length()
		v = 1 << depth
		for i in range(depth, -1, -1):
			k = pos + v
			if k <= self.n and s + self.bit[k] < x:
				s += self.bit[k]
				pos += v
			v >>= 1
		return pos
bit = BIT(len(order) + 1)
for l in left:
	bit.add(l, 1)
for (u, k) in UK:
	l = left[u]
	r = right[u]
	t = bit.sum(l, r + 1)
	if t < k + 1:
		print(-1)
	else:
		p = bit.sum(0, l)
		x = bit.lower_bound(p + k + 1)
		print(order[x] + 1)


import math
from collections import defaultdict
import sys

def main():
	(n, q) = map(int, input().split())
	children = [[] for _ in range(n)]
	parent = list(map(int, input().split()))
	for i in range(n - 1):
		children[parent[i] - 1].append(i + 1)
	d = []
	cnt = [1] * n
	stack = [0]

	def dfs():
		while stack:
			node = stack.pop()
			d.append(node)
			for i in range(len(children[node]) - 1, -1, -1):
				stack.append(children[node][i])
	dfs()
	for i in range(n - 1, -1, -1):
		total = 0
		for child in children[i]:
			total += cnt[child]
		cnt[i] += total
	indexof = [-1] * n
	for (i, val) in enumerate(d):
		indexof[val] = i
	for _ in range(q):
		(u, k) = map(int, input().split())
		index = indexof[u - 1]
		pos = index + k - 1
		if k > cnt[u - 1]:
			print(-1)
		else:
			print(d[pos] + 1)
main()


def dfs(dp, node, edges, order):
	visited = set()
	stack = [node]
	while stack:
		curr = stack[-1]
		if curr not in visited:
			visited.add(curr)
			order.append(curr)
		count = 0
		for kid in edges[curr]:
			if kid in visited:
				count += 1
			else:
				stack.append(kid)
		if count == len(edges[curr]):
			stack.pop()
			for kid in edges[curr]:
				dp[curr] += dp[kid]
			dp[curr] += 1

def solve(u, k, dp, order, indices, ans):
	if k > dp[u]:
		ans.append(-1)
		return
	index = indices[u]
	ans.append(order[index + k - 1])

def main():
	(n, q) = list(map(int, input().split()))
	parents = list(map(int, input().split()))
	edges = {}
	for i in range(1, n + 1):
		edges[i] = []
	for i in range(2, n + 1):
		parent = parents[i - 2]
		edges[parent].append(i)
	for i in list(edges.keys()):
		edges[i].sort(reverse=True)
	indices = [-1] * (n + 1)
	order = []
	dp = [0] * (n + 1)
	dfs(dp, 1, edges, order)
	for i in range(n):
		indices[order[i]] = i
	ans = []
	for i in range(q):
		(u, k) = list(map(int, input().split()))
		solve(u, k, dp, order, indices, ans)
	for i in ans:
		print(i)
main()


(n, q) = map(int, input().split())
v = list(map(int, input().split()))
d = [list() for i in range(n)]
r = [1] * n
l = [0] * n
for j in range(n - 1):
	d[v[j] - 1].append(j + 1)

def push():
	stack = list()
	re_stack = list()
	stack.append(0)
	while True:
		if len(stack) == 0:
			return re_stack
		tmp = stack.pop(0)
		re_stack.append(tmp)
		tmp_ = d[tmp]
		stack = tmp_ + stack
s = push()
for i in range(n):
	l[s[i]] = i
for i in range(n - 1, -1, -1):
	for j in d[s[i]]:
		r[s[i]] += r[j]
ss = []
for x in range(q):
	(u, k) = map(int, input().split())
	if k > r[u - 1]:
		ss.append(-1)
	else:
		ss.append(s[l[u - 1] + k - 1] + 1)
print('\n'.join(map(str, ss)))


(n, q) = map(int, input().split())
from heapq import heappush as pu
from heapq import heappop as po
from bisect import bisect_right as br
tr = [[] for i in range(n)]
size = [1 for i in range(n)]
p = list(map(int, input().split()))
p = [i - 1 for i in p]
for i in range(n - 1):
	tr[p[i]].append(i + 1)
for i in range(n):
	tr[i].sort(reverse=True)
h = {}
h[0] = 0
s = [0]
m = []
while s:
	x = s.pop()
	m.append(x)
	for i in tr[x]:
		s.append(i)
		h[i] = h[x] + 1
d = [(i, h[i]) for i in range(n)]
d.sort(key=lambda x: x[1])
d = [i[0] for i in d]
for i in range(n - 1, 0, -1):
	size[p[d[i] - 1]] += size[d[i]]
ind = {}
for i in range(n):
	ind[m[i]] = i
for _ in range(q):
	(u, k) = map(int, input().split())
	u -= 1
	if k > size[u]:
		print(-1)
	else:
		i = ind[u]
		print(m[i + k - 1] + 1)


len = len

def dfs(root, tree, path, pos, size):
	index = {}
	stack = [root]
	while len(stack) > 0:
		vertex = stack[-1]
		if vertex not in index:
			path.append(vertex)
			pos[vertex] = len(path) - 1
			index[vertex] = 0
		if index[vertex] == len(tree[vertex]):
			stack.pop()
			size[vertex] = len(path) - pos[vertex]
		else:
			stack.append(tree[vertex][index[vertex]])
			index[vertex] = index[vertex] + 1
(n, q) = map(int, input().split())
edges = [int(x) for x in input().split()]
tree = [[] for _ in range(n + 1)]
for i in range(len(edges)):
	tree[edges[i]].append(i + 2)
path = []
pos = [[0] for _ in range(n + 1)]
size = [[0] for _ in range(n + 1)]
dfs(1, tree, path, pos, size)
for _ in range(q):
	(u, k) = map(int, input().split())
	if k > size[u] or pos[u] + k - 1 >= len(path):
		print(-1)
	else:
		print(path[pos[u] + k - 1])


from collections import deque as dq
from collections import defaultdict as dc

def dfs(stack, vis, child, when, ab):
	while len(stack) > 0:
		a = stack[-1]
		if vis[a] == 1:
			child[a] = len(ab) - when[a]
			c = stack.pop()
			continue
		ab.append(a)
		when[a] = len(ab) - 1
		vis[a] = 1
		for i in reversed(adj[a]):
			stack.append(i)
adj = dc(list)
(n, q) = list(map(int, input().split()))
child = [0] * (n + 1)
when = [0] * (n + 1)
ab = []
vis = [0] * (n + 1)
stack = dq([1])
a = list(map(int, input().split()))
for i in range(2, n + 1):
	adj[a[i - 2]].append(i)
dfs(stack, vis, child, when, ab)
z = []
for i in range(q):
	(x, y) = list(map(int, input().split()))
	y = y - 1
	if y >= child[x]:
		z.append(str(-1))
	else:
		z.append(str(ab[when[x] + y]))
print('\n'.join(z))


from __future__ import print_function
import sys
from collections import *
from heapq import *
from functools import *
import re
from itertools import *
from bisect import *
INF = float('inf')
NINF = float('-inf')
try:
	input = raw_input
except:
	pass

def read_string():
	return input()

def read_string_line():
	return [x for x in input().split(' ')]

def read_int_line():
	return [int(x) for x in input().split(' ')]

def read_int():
	return int(input())
(n, q) = read_int_line()
p = [0, -1] + read_int_line()
adjs = [[] for _ in range(n + 1)]
for i in range(2, n + 1):
	adjs[p[i]].append(i)
for adj in adjs:
	adj.sort()
total = [0] + [1] * n
o = []
pos = [1] * (n + 1)
posa = [1] * (n + 1)
l = [1] * (n + 1)
t = 0

def dfs(x):
	global t
	st = []
	st.append(x)
	last = -1
	while st:
		cur = st[-1]
		if not adjs[cur]:
			l[t] = cur
			pos[cur] = t
			t += 1
			posa[cur] = t
			last = st.pop()
		elif last == adjs[cur][-1]:
			posa[cur] = t
			last = st.pop()
		else:
			l[t] = cur
			pos[cur] = t
			t += 1
			st += adjs[cur][::-1]
dfs(1)
ans = []
for _ in range(q):
	(u, k) = read_int_line()
	if k > posa[u] - pos[u]:
		ans.append('-1')
		continue
	else:
		ans.append(str(l[pos[u] + k - 1]))
print('%s' % '\n'.join(ans))


from collections import deque
len = len
t = 0

def porder():
	global adjList, order, span, t
	stack = deque()
	stack.append(0)
	while len(stack):
		cur = stack.pop()
		if cur in span.keys():
			span[cur].append(t)
		else:
			stack.append(cur)
			order.append(cur)
			span[cur] = [t]
			for num in adjList[cur]:
				stack.append(num)
			t += 1
(n, q) = map(int, input().rstrip().split())
arr = [int(x) - 1 for x in input().rstrip().split()]
adjList = {}
order = []
span = {}
for i in range(n):
	adjList[i] = []
for i in range(n - 1):
	adjList[arr[i]].insert(0, i + 1)
porder()
for i in range(q):
	(u, k) = map(int, input().rstrip().split())
	u -= 1
	k -= 1
	range = span[u]
	if range[0] + k >= range[1]:
		print(-1)
	else:
		print(order[range[0] + k] + 1)


(n, q) = map(int, input().split())
sups = list(map(int, input().split()))
dir_subs = [[] for i in range(n + 1)]
num_subs = [0] * (n + 1)
sups = [0, 0] + sups
for i in range(2, n + 1):
	dir_subs[sups[i]].append(i)
prev_parent = 0
qe = [1]
ordered = []
while len(qe) > 0:
	new = qe.pop()
	if new > 0:
		ordered.append(new)
		qe.append(-new)
		num = len(dir_subs[new])
		for i in range(num):
			qe.append(dir_subs[new][num - 1 - i])
	else:
		parent = -new
		for child in dir_subs[parent]:
			num_subs[parent] += 1
			num_subs[parent] += num_subs[child]
indices = [0] * (n + 1)
for i in range(n):
	indices[ordered[i]] = i

def ans_query(u, k):
	if k - 1 > num_subs[u]:
		return -1
	start = indices[u]
	end = ordered[start + k - 1]
	return end
s = ''
for i in range(q):
	(u, k) = map(int, input().split())
	s += str(ans_query(u, k)) + '\n'
	if i % 20 == 0:
		print(s[:-1])
		s = ''
if len(s) > 0:
	print(s[:-1])


import os.path
from math import gcd, floor, ceil
from collections import *
import sys
mod = 1000000007
INF = float('inf')

def st():
	return list(sys.stdin.readline().strip())

def li():
	return list(map(int, sys.stdin.readline().split()))

def mp():
	return map(int, sys.stdin.readline().split())

def inp():
	return int(sys.stdin.readline())

def pr(n):
	return sys.stdout.write(str(n) + '\n')

def prl(n):
	return sys.stdout.write(str(n) + ' ')
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
(n, Q) = mp()
d = defaultdict(list)
l = li()
for (i, ele) in enumerate(l):
	d[i + 2].append(ele)
	d[ele].append(i + 2)
for i in d:
	d[i].sort(reverse=True)
stack = [1]
x = []
le = 0
ans = []
sub = defaultdict(lambda : 1)
v = defaultdict(int)
occ = defaultdict(lambda : -1)
while stack:
	a = stack[-1]
	if not v[a]:
		occ[a] = le
		x.append(a)
		le += 1
	v[a] = 1
	f = 0
	for i in d[a]:
		if a - 2 >= 0:
			if i == l[a - 2]:
				continue
		if not v[i]:
			stack.append(i)
			f = 1
	if f == 0:
		if stack:
			a = stack.pop()
			if a > 1:
				sub[l[a - 2]] += sub[a]
for i in range(Q):
	(a, b) = mp()
	if b > sub[a]:
		ans.append(-1)
	else:
		ans.append(x[occ[a] + b - 1])
print(*ans, sep='\n')


from sys import *
from math import *
generals = []

class Node:

	def __init__(self, value):
		self.value = value
		self.children = []
		self.start = -1
		self.end = -1

	def add(self, fnode):
		self.children.append(fnode)

def explore(node, index):
	stack = []
	stack.append(node)
	while len(stack) > 0:
		n = stack.pop()
		generals.append(n.value)
		n.start = index
		index += 1
		for child in n.children[::-1]:
			stack.append(child)
	stack = []
	stack.append(node)
	while len(stack) > 0:
		n = stack.pop()
		for i in range(len(n.children)):
			child = n.children[i]
			if i == len(n.children) - 1:
				child.end = n.end
			else:
				child.end = n.children[i + 1].start
		for child in n.children[::-1]:
			stack.append(child)

def printN(node):
	print(node.value, end=' ')
	print(node.start, end=' ')
	print(node.end)
	for n in node.children:
		printN(n)
nodes = []
line = stdin.readline().rstrip().split()
n = int(line[0])
q = int(line[1])
for i in range(n):
	nodes.append(Node(i + 1))
dependencies = list(map(int, stdin.readline().rstrip().split()))
for i in range(len(dependencies)):
	nodes[dependencies[i] - 1].add(nodes[i + 1])
nodes[0].start = 0
nodes[0].end = n
explore(nodes[0], 0)
for i in range(q):
	line = stdin.readline().rstrip().split()
	u = int(line[0])
	k = int(line[1]) - 1
	node = nodes[u - 1]
	if k < node.end - node.start:
		print(generals[node.start + k])
	else:
		print(-1)


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import *
from copy import *
from collections import deque
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from types import GeneratorType

def iterative(f, stack=[]):

	def wrapped_func(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		to = f(*args, **kwargs)
		while True:
			if type(to) is GeneratorType:
				stack.append(to)
				to = next(to)
				continue
			stack.pop()
			if not stack:
				break
			to = stack[-1].send(to)
		return to
	return wrapped_func
mod = 1000000007

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(a, b):
	ans = 1
	while b > 0:
		if b % 2 == 1:
			ans *= a
		a *= a
		b //= 2
	return ans

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True
cnt = [0]

@iterative
def dfs(v, visited, st, new, stime, endtime):
	new.append(st)
	visited[st] = 1
	stime[st] = cnt[0]
	cnt[0] += 1
	for i in v[st]:
		if visited[i] == 0:
			ok = (yield dfs(v, visited, i, new, stime, endtime))
	endtime[st] = cnt[0]
	cnt[0] += 1
	yield True

def solve():
	(n, q) = sep()
	p = lis()
	graph = [[] for i in range(n)]
	for i in range(0, n - 1):
		(a, b) = (i + 1, p[i] - 1)
		graph[a].append(b)
		graph[b].append(a)
	for i in range(n):
		graph[i] = sorted(graph[i])
	sttime = [0] * n
	endtime = [0] * n
	new = []
	vis = [0] * n
	dfs(graph, vis, 0, new, sttime, endtime)
	pos = [0] * n
	for i in range(n):
		pos[new[i]] = i
	for i in range(q):
		(a, k) = sep()
		a -= 1
		ind = pos[a]
		to = ind + k - 1
		if to < n and sttime[new[to]] >= sttime[a] and (endtime[new[to]] <= endtime[a]):
			print(new[to] + 1)
		else:
			print(-1)
testcase(1)