#include <bits/stdc++.h>
using namespace std;
#define int long long
const int LOG = 18;
int N,Q;
int subtree[100005];
vector<int> graph[100005];
int post[100005];
int depth[100005];
bool filled[100005];
int up[100005][LOG];
int timer = 0;
struct cmp{
bool operator()(const int &a, const int &b){
return post[a] > post[b];
}
};
void dfs(int node, int par){
subtree[node] = node;
for(int v : graph[node]){
if(v == par) continue;
depth[v] = depth[node] + 1;
dfs(v, node);
subtree[node] = min(subtree[node], subtree[v]);
}
}
void post_order(int node, int par){
for(int v : graph[node]){
if(v != par)
post_order(v, node);
}
post[node] = timer++;
}
void binary_lift(int node, int par){
for(int v : graph[node]){
if(v == par) continue;
up[v][0] = node;
for(int j = 1; j < LOG; j++)
up[v][j] = up[up[v][j - 1]][j - 1];
binary_lift(v, node);
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N >> Q;
int root = -1;
for(int i = 0; i < N; i++){
subtree[i] = 100005;
int x; cin >> x;
x--;
if(x == -1) root = i;
else{
graph[x].emplace_back(i);
graph[i].emplace_back(x);
}
}
assert(root != -1);
depth[root] = 0;
dfs(root, -1);
up[root][0] = root;
for(int i = 0; i < N; i++){
sort(graph[i].begin(), graph[i].end(), [&](const int &x, const int &y){
return subtree[x] < subtree[y];
});
}
binary_lift(root, -1);
post_order(root, -1);
priority_queue<int, vector<int>, cmp> khaali;
for(int i = 0; i < N; i++)
khaali.push(i);
while(Q--){
int T,K; cin >> T >> K;
if(T == 1){
for(int j = 0; j < K; j++){
int x = khaali.top();
khaali.pop();
filled[x] = true;
if(j == K - 1) cout << x + 1 << '\n';
}
}
else{
K--;
int pos = K;
for(int i = LOG - 1; i >= 0; i--){
if(filled[up[pos][i]])
pos = up[pos][i];
}
filled[pos] = false;
khaali.push(pos);
cout << depth[K] - depth[pos] << '\n';
}
}
return 0;
}
