#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define f first
#define s second
#define pb push_back
#define ep emplace
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define uniquev(v) sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define mem(f,x) memset(f , x , sizeof(f))
#define sz(x) (int)(x).size()
#define __lcm(a, b) (1ll * ((a) / __gcd((a), (b))) * (b))
#define mxx *max_element
#define mnn *min_element
#define cntbit(x) __builtin_popcountll(x)
#define len(x) (int)(x.length())
const int N = 2e5 + 100;
vector <int> ed[N];
int sp[N][20], sz[N], is[N], dep[N], mn[N], id[N], timer = 1;
void dfs(int u, int v) {
dep[u] = dep[v] + 1;
mn[u] = u;
for (auto x : ed[u]) {
dfs(x, u);
mn[u] = min(mn[u], mn[x]);
}
sort(all(ed[u]), [&] (int a, int b) {return mn[a] < mn[b];});
}
void dfs2(int u, int v) {
for (auto x : ed[u]) {
dfs(x, u);
}
id[u] = timer++;
}
ll solve() {
mem(mn, 0x3f);
ll n, q, root = 0;
cin >> n >> q;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (x) {
ed[x].pb(i);
sz[x]++;
sp[i][0] = x;
} else {
root = i;
}
}
dfs(root, root);
dfs2(root, root);
for (int i = 1; i <= n; i++) {
for (int j = 1; j < 20; j++) {
sp[i][j] = sp[sp[i][j - 1]][j - 1];
}
}
set <pair <int, int>> st;
for (int i = 1; i <= n; i++) {
if (sz[i] == 0) {
st.insert({id[i], i});
}
}
while (q--) {
int t, x;
cin >> t >> x;
if (t == 1) {
int pr = 0;
for (int i = 1; i <= x; i++) {
auto t = *st.begin();
st.erase(t);
pr = t.s;
is[pr] = 1;
sz[sp[pr][0]]--;
if (sp[pr][0] && sz[sp[pr][0]] == 0) {
st.insert({id[sp[pr][0]], sp[pr][0]});
}
}
cout << pr << '\n';
} else {
int v = x;
for (int i = 19; i >= 0; i--) {
if (is[sp[x][i]]) {
x = sp[x][i];
}
}
sz[sp[x][0]]++;
is[x] = 0;
if (sp[x][0] && sz[sp[x][0]] == 1) {
st.erase({id[sp[x][0]], sp[x][0]});
}
st.insert({id[x], x});
cout << dep[v] - dep[x] << '\n';
}
}
return 0;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
//cin >> t;
while (t--) {
solve();
//cout << solve() << '\n';
}
return 0;
}
