#include <bits/stdc++.h>
#define FOR(x, a, b) for (int x = a; x <= b; ++x)
#define FOD(x, a, b) for (int x = a; x >= b; --x)
#define REP(x, a, b) for (int x = a; x < b; ++x)
#define DEBUG(X) { cout << #X << " = " << X << endl; }
#define PR(A, n) { cout << #A << " = "; FOR(_, 1, n) cout << A[_] << " "; cout << endl; }
#define PR0(A, n) { cout << #A << " = "; REP(_, 0, n) cout << A[_] << " "; cout << endl; }
using namespace std;
typedef long long LL;
typedef pair <int, int> II;
const int N = 1e5 + 10;
int n, q, Root, timer = 0, eulerSize = 0;
int x[N], V[N], c[N], pos[N], euler[N];
int headChain[N], szChain[N], p[N];
bool ban[N];
vector <int> adj[N];
set <II> S;
void EulerTour(int u) {
REP(k, 0, adj[u].size()) {
int v = adj[u][k];
EulerTour(v);
}
euler[++eulerSize] = u;
}
int Insert(int num) {
while (num > 0) {
int u = S.begin() -> second; S.erase(S.begin());
ban[u] = true;
--num;
if (num == 0) return u;
}
assert(false);
}
int Remove(int u) {
int ans = 0;
while (ban[p[u]] == true) {
++ans;
u = p[u];
}
ban[u] = false;
S.insert(II(pos[u], u));
return ans;
}
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("ans.txt", "w", stdout);
#endif // LOCAL
scanf("%d%d", &n, &q);
FOR(i, 1, n) {
scanf("%d", &p[i]);
if (p[i] == 0) Root = i;
else adj[p[i]].push_back(i);
}
FOR(i, 1, n) sort(adj[i].begin(), adj[i].end());
EulerTour(Root);
FOR(i, 1, eulerSize) pos[euler[i]] = i;
FOR(i, 1, n) S.insert(II(pos[i], i));
FOR(timer, 1, q) {
int t, u; scanf("%d%d", &t, &u);
if (t == 1) printf("%d\n", Insert(u));
else printf("%d\n", Remove(u));
}
return 0;
}
