#include<bits/stdc++.h>
using namespace std;

const int _ = 1e6 + 7; int sz[_] , son[_] , top[_] , N , Q; vector < int > nxt[_];
struct ans{int id , x , y;}; vector < ans > pans , pot[_]; mt19937 rnd(11177077);

void push1(int x , int y){pans.push_back((ans){1 , x , y});}
void push2(){pans.push_back((ans){2});}
void push3(int x){pans.push_back((ans){3 , x});}

void dfs1(int x , int p){sz[x] = 1; for(auto t : nxt[x]) if(t != p){dfs1(t , x); sz[x] += sz[t]; son[x] = sz[son[x]] < sz[t] ? t : son[x];}}
void dfs2(int x){
	for(int p = x ; p ; p = son[p]) for(auto t : nxt[p]) if(sz[t] < sz[p] && t != son[p]) dfs2(t);
	int cnt = 0; static int id[_]; vector < pair < int , int > > seq; for(int p = x ; p ; p = son[p]){id[p] = cnt++; seq.emplace_back(p , sz[p] - sz[son[p]]);}
	int num = sqrt(N) + rnd() % 5 , lft = 0; vector < ans > temp;
	for(int i = 0 ; i < seq.size() ; ++i){
		lft += seq[i].second; temp.insert(temp.end() , pot[seq[i].first].begin() , pot[seq[i].first].end());
		if(lft > num || i + 1 == seq.size()){
			sort(temp.begin() , temp.end() , [&](ans p , ans q){return id[p.x] + p.y < id[q.x] + q.y;}); int cnt = 0;
			for(auto t : temp)
				if(id[t.x] + t.y - 1 < i){push1(t.x , t.y); push3(t.id); push2();}
				else{
					++cnt; push1(seq[i].first , id[t.x] + t.y - i);
					push1(t.x , t.y); push3(t.id); push2();
				}
			while(cnt--) push2();
			temp.clear(); lft = 0;
		}
	}
}

int main(){
	ios::sync_with_stdio(0); cin >> N >> Q; for(int i = 2 ; i <= N ; ++i){int p; cin >> p; nxt[i].push_back(p); nxt[p].push_back(i);}
	//for(int i = 1 ; i <= N ; ++i) random_shuffle(nxt[i].begin() , nxt[i].end() , rnd);
	for(int i = 1 ; i <= Q ; ++i){int x , y; cin >> x >> y; if(!y) pans.push_back((ans){3 , i}); else pot[x].push_back((ans){i , x , y});}
	dfs1(1 , 0); dfs2(1);
	cout << pans.size() << endl;
	for(auto t : pans) if(t.id == 1) cout << 1 << ' ' << t.x << ' ' << t.y << '\n';
		else if(t.id == 2) cout << 2 << '\n'; else cout << 3 << ' ' << t.x << '\n';
	return 0;
}