#include<iostream>

#include<cstdio>

#include<queue>

#include<algorithm>

#include<vector>

#define N 100009

using namespace std;

int p[][N],deep[N],n,dfn[N],tot,root,dp[N];

bool tag[N];

struct node{

    int x;

    bool operator <(const node &b)const{

        return dfn[x]>dfn[b.x];

    }

};

priority_queue<node>q;

vector<int>vec[N];

inline int rd(){

    int x=;char c=getchar();bool f=;

    while(!isdigit(c)){if(c=='-')f=;c=getchar();}

    while(isdigit(c)){x=(x<<)+(x<<)+(c^);c=getchar();}

    return f?-x:x;

}

inline bool cmp(int a,int b){return dp[a]<dp[b];}

void predfs(int u){

    dp[u]=u;

    for(int i=;i<vec[u].size();++i){

        int v=vec[u][i];predfs(v);

        dp[u]=min(dp[u],dp[v]);

    }

}

void dfs(int u){

    for(int i=;(<<i)<=deep[u];++i)p[i][u]=p[i-][p[i-][u]];

    for(int i=;i<vec[u].size();++i){

        int v=vec[u][i];deep[v]=deep[u]+;p[][v]=u;

        dfs(v);

    }

    dfn[u]=++tot;

}

int main(){

    n=rd();int qu=rd();int x,opt,fa;

    for(int i=;i<=n;++i){fa=rd();if(!fa)root=i;vec[fa].push_back(i);}

    predfs(root);

    for(int i=;i<=n;++i)sort(vec[i].begin(),vec[i].end(),cmp);

    dfs(root);

    for(int i=;i<=n;++i)q.push(node{i});

    while(qu--){

        opt=rd();x=rd();

        if(opt==){

            int id;

            for(int i=;i<=x;++i){

                id=q.top().x;q.pop();

                tag[id]=;

            }

            printf("%d\n",id);

        }

        else{

            int now=x;

            for(int i=;i>=;--i)if(p[i][now]&&tag[p[i][now]])now=p[i][now];

            tag[now]=;q.push(node{now});printf("%d\n",deep[x]-deep[now]);

        }

    }

    return ;

}