#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);
/* -------------------- Typedefs -------------------- */
typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;
/* -------------------- Usings -------------------- */
using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
/* -------------------- Defines -------------------- */
#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);
/* -------------------- Constants -------------------- */
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);
/* -------------------- Functions -------------------- */
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void precision(int x) {
cout.setf(ios::fixed | ios::showpoint);
cout.precision(x);
}
ll gcd(ll a, ll b) {
if (a == 0 || b == 0) return(max(a, b));
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll range_sum(ll a, ll b) {
if (a > b) return 0ll;
ll dif = a - 1, cnt = b - a + 1;
ll ans = ((b - a + 1) * (b - a + 2)) / 2;
ans += ((b - a + 1) * dif);
return ans;
}
string dec_to_bin(ll a) {
string s = "";
for (ll i = a; i > 0; ) {
ll k = i % 2;
i /= 2;
char c = k + 48;
s += c;
}
if (a == 0) {
s = "0";
}
reverse(all(s));
return s;
}
ll bin_to_dec(string s) {
ll num = 0;
for (int i = 0; i < s.size(); i++) {
num *= 2ll;
num += (s[i] - '0');
}
return num;
}
ll factorial_by_mod(ll n, ll mod) {
ll ans = 1;
ll num;
for (ll i = 1; i <= n; ++i) {
num = i % mod;
ans *= num;
ans %= mod;
}
return ans;
}
int isPrime(ll a) {
if (a == 1) return 0;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) return 0;
}
return 1;
}
ll binpow(ll a, ll b) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
}
b >>= 1;
a *= a;
}
return ans;
}
ll binpow_by_mod(ll a, ll b, ll mod) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= mod;
}
b >>= 1;
a *= a;
a %= mod;
}
return ans;
}
/* -------------------- Solution -------------------- */
const int N = 100005, M = 31;
int id[N], id_rev[N], p[N], up[N][M], dep[N], t[N * 4], lazy[N * 4], mark[N * 4], ran[N * 4];
vi g[N];
int n, q, lg, root, cur;
void prop(int pos) {
if (!mark[pos]) return;
t[2 * pos] = ran[2 * pos] * lazy[pos];
t[2 * pos + 1] = ran[2 * pos + 1] * lazy[pos];
lazy[2 * pos] = lazy[2 * pos + 1] = lazy[pos];
mark[2 * pos] = mark[2 * pos + 1] = 1;
mark[pos] = 0;
}
void bld(int l = 1, int r = n, int pos = 1) {
ran[pos] = r - l + 1;
if (l == r) return;
int mid = (l + r) / 2;
bld(l, mid, 2 * pos);
bld(mid + 1, r, 2 * pos + 1);
}
int qry(int l, int r, int tl = 1, int tr = n, int pos = 1) {
if (l == tl && r == tr) {
return t[pos];
}
prop(pos);
int mid = (tl + tr) / 2;
if (mid >= r) {
return qry(l, r, tl, mid, 2 * pos);
}
if (mid < l) {
return qry(l, r, mid + 1, tr, 2 * pos + 1);
}
return qry(l, mid, tl, mid, 2 * pos) + qry(mid + 1, r, mid + 1, tr, 2 * pos + 1);
}
void upd(int l, int r, int val, int tl = 1, int tr = n, int pos = 1) {
if (l == tl && r == tr) {
t[pos] = val * ran[pos];
lazy[pos] = val;
mark[pos] = 1;
return;
}
prop(pos);
int mid = (tl + tr) / 2;
if (mid >= r) {
upd(l, r, val, tl, mid, 2 * pos);
}
else if (mid < l) {
upd(l, r, val, mid + 1, tr, 2 * pos + 1);
}
else {
upd(l, mid, val, tl, mid, 2 * pos);
upd(mid + 1, r, val, mid + 1, tr, 2 * pos + 1);
}
t[pos] = t[2 * pos] + t[2 * pos + 1];
}
void dfs(int u = root, int depth = 0) {
dep[u] = depth;
up[u][0] = p[u];
for (int i = 1; i <= lg; ++i) {
up[u][i] = up[up[u][i - 1]][i - 1];
}
for (auto to : g[u]) {
dfs(to, depth + 1);
}
id[u] = ++cur;
id_rev[cur] = u;
}
int get_up(int u, int cnt) {
for (int i = lg; i >= 0; --i) {
if ((1 << i) <= cnt) {
cnt -= (1 << i);
u = up[u][i];
}
}
return u;
}
void slv() {
cin >> n >> q;
lg = log2(n) + 1;
for (int i = 1; i <= n; ++i) {
cin >> p[i];
if (!p[i]) root = p[i] = i;
else g[p[i]].pub(i);
}
dfs();
bld();
while (q--) {
int type, x;
cin >> type >> x;
if (type == 1) {
int l = 1, r = n, mid, ind = 0;
while (l <= r) {
mid = (l + r) / 2;
int cnt = qry(1, mid);
if (mid - cnt < x) {
l = mid + 1;
}
else if (mid - cnt == x) {
ind = mid;
r = mid - 1;
}
else {
r = mid - 1;
}
}
upd(1, ind, 1);
cout << id_rev[ind] << '\n';
continue;
}
int l = 1, r = dep[x], mid, ans = 0, gag = x;
while (l <= r) {
mid = (l + r) / 2;
int u = get_up(x, mid);
if (qry(id[u], id[u])) {
gag = u;
ans = mid;
l = mid + 1;
}
else {
r = mid - 1;
}
}
upd(id[gag], id[gag], 0);
cout << ans << '\n';
}
}
void cs() {
int tstc = 1;
//cin >> tstc;
while (tstc--) {
slv();
}
}
void precalc() {
return;
}
int main() {
fastio();
precalc();
//precision(0);
cs();
return 0;
}
