#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cctype>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;
inline int read(){
int w=0,x=0;char c=getchar();
while(!isdigit(c))w|=c=='-',c=getchar();
while(isdigit(c))x=x*10+(c^48),c=getchar();
return w?-x:x;
}
namespace star
{
const int maxn=1e5+10;
int n,Q;
int fa[maxn][21],rt,dfn[maxn],tot,id[maxn],mn[maxn];
bool vis[maxn];
vector<int> q,G[maxn];
void dfs1(int x){
mn[x]=x;
for(int i=0;i<G[x].size();i++)
dfs1(G[x][i]),mn[x]=min(mn[x],mn[G[x][i]]);
}
inline bool cmp1(int a,int b){return mn[a]<mn[b];}
void dfs(int x){
for(int i=0;i<20;i++) fa[x][i+1]=fa[fa[x][i]][i];
sort(G[x].begin(),G[x].end(),cmp1);
for(int i=0;i<G[x].size();i++)
dfs(G[x][i]);
dfn[x]=++tot;
id[tot]=x;
}
inline bool cmp(int a,int b){return dfn[a]>dfn[b];}
inline void work(){
n=read(),Q=read();
for(int i=1;i<=n;i++){
if((fa[i][0]=read())==0) rt=i;
G[fa[i][0]].push_back(i);
}
dfs1(rt);
dfs(rt);q.resize(n),q.clear();
for(int i=n;i;i--) q.push_back(id[i]);
while(Q--)
if(read()==1){
int num=read();
while(--num)vis[q.back()]=1,q.pop_back();
printf("%d\n",q.back());
vis[q.back()]=1;q.pop_back();
}else{
int x=read();
if(!vis[x]){puts("0");continue;}//数据合法,好像没用
int f=x,ans=0;
for(int i=20;~i;i--) if(vis[fa[f][i]])f=fa[f][i],ans|=(1<<i);
vis[f]=0;
q.insert(upper_bound(q.begin(),q.end(),f,cmp),f);
printf("%d\n",ans);
}
}
}
signed main(){
star::work();
return 0;
}