#include<bits/stdc++.h>
#define ci const int
#define ll long long
using namespace std;
char buf[1<<20],*p1=buf,*p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
int read(){int res(0);char ch(getchar());while(ch<48||ch>57)ch=getchar();while(ch>=48&&ch<=57)res=(res<<1)+(res<<3)+(ch^48),ch=getchar();return res;}
void out(ci x){x>9?out(x/10),putchar(x%10+48):putchar(x%10+48);}
ci N=1e6+5;
int n,m,B,f[N],dn[N],dep[N],top,T;
bool bz[N];
vector<int>g[N];
vector<vector<int> >ans;
pair<int,bool>dfs(ci x){
	dep[x]=dep[f[x]]+1;
	int siz=0,cnt=0;
	for(int y:g[x]){
		pair<int,bool>t=dfs(y);
		siz+=t.first+1,cnt+=t.second;
	}
	if(cnt>=2||siz>=B)bz[x]=1,siz=0,++T;
	return make_pair(siz,cnt||bz[x]);
}
void P1(ci x,ci y){
	ans.push_back({1,x,y}),++top;
}
void P2(){
	ans.push_back({2}),--top;
}
void P3(ci x){
	ans.push_back({3,x});
}
struct node{
	int i,x,y;
	node(int i=0,int x=0,int y=0):i(i),x(x),y(y){}
	inline bool operator < (const node &t)const{
		return dep[x]+y<dep[t.x]+t.y;
	}
};
vector<node>vec[N];
int main(){
	n=read(),m=read(),B=sqrt(n)+1;
	for(int i=2;i<=n;++i)g[f[i]=read()].push_back(i);
	dfs(1);
	for(int i=1;i<=n;++i)
		if(bz[i])
			for(int j=i;j&&!dn[j];j=f[j])
				dn[j]=i;
	for(int i=1,x,y;i<=m;++i){
		x=read(),y=read();
		if(!y)P3(i);
		else if(!dn[x])P1(x,y),P3(i),P2();
		else vec[dn[x]].push_back(node(i,x,y));
	}
	for(int i=1;i<=n;++i)
		if(bz[i]&&vec[i].size()){
			sort(vec[i].begin(),vec[i].end());
			while(top)P2();
			for(auto t:vec[i])P1(i,max(t.y+dep[t.x]-dep[i],0)),P1(t.x,t.y),P3(t.i),P2();
		}
	out(ans.size()),putchar(10);
	for(auto t:ans){
		for(int x:t)out(x),putchar(32);
		putchar(10);
	}
	return 0;
}