#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define Neco "Ball Machine"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 2e5 + 7
using namespace std;
const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r)
{
return uniform_int_distribution<ll> (l, r)(rng);
}
int n, q, N, rt;
int Min[maxn], h[maxn], a[maxn];
vector<int> edges[maxn];
void pre_dfs(int u, int par) {
for(int v : edges[u]) if(v != par) {
Min[u] = min(Min[u], Min[v]);
pre_dfs(v, u);
}
}
void dfs(int u, int par) {
for(int v : edges[u]) if(v != par) h[v] = h[u] + 1, dfs(v, u);
a[++N] = u;
}
void solve()
{
cin >> n >> q;
int rt = 0;
fi(i, 1, n) {
int x; cin >> x;
if(x == 0) rt = i;
else edges[x].push_back(i);
}
pre_dfs(rt, 0);
fi(i, 1, n) sort(all(edges[i]), [](int x, int y) { return Min[x] < Min[y]; } );
dfs(rt, 0);
N = 0;
fi(i, 1, q) {
int type, x;
cin >> type >> x;
if(type == 1) N += x, cout << a[N] << '\n';
else cout << h[x] - h[a[N]] << '\n', --N;
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen(Neco".inp", "r")) {
freopen(Neco".inp", "r", stdin);
freopen(Neco".out", "w", stdout);
}
int nTest = 1;
// cin >> nTest;
while(nTest--)
{
solve();
}
return 0;
}
