rt, WA on #5 #6 #29 #30 #41 #42

#include <bits/stdc++.h>
using namespace std;
#define il inline
typedef long long ll;
const int N = 1e5 + 10;
int f1[N][31], f2[N][31], dp[N], fa[N];
vector<int> g[N];
il void dfs(int u)
{
	f1[u][0] = fa[u];
	for(int i = 1;i < 31;++i) f1[u][i] = f1[f1[u][i - 1]][i - 1];
	dp[u] = u;
	int minn = 2e9;
	for(auto v : g[u])
	{
		dfs(v);
		dp[u] = min(dp[u], dp[v]);
		minn = min(minn, dp[v]);
	}
	f2[u][0] = (minn == 2e9 ? u : minn);
	for(int i = 1;i < 31;++i) f2[u][i] = f2[f2[u][i - 1]][i - 1];
}
il int qry1(int x, int k)
{
	for(int i = 0;k > 0;++i, k >>= 1)
		if(k & 1) x = f1[x][i];
	return x;	
} 
il int qry2(int x, int k)
{
	for(int i = 0;k > 0;++i, k >>= 1)
		if(k & 1) x = f2[x][i];
	return x;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int n, q;cin >> n >> q;
	fa[1] = 1;
	for(int i = 2;i <= n;++i)
	{
		cin >> fa[i];
		g[fa[i]].push_back(i);
	}
	dfs(1);
	while(q--)
	{
		int s, k;
		cin >> s >> k;
		while(k--)
		{
			int x;cin >> x;
			if(x > 0) s = qry1(s, x);
			else s = qry2(s, -x);
		}
		cout << s << "\n";
	}
	return 0;
}