Yuezheng Ling gives Luo Tianyi a tree which has n nodes, rooted at 1. 

Luo Tianyi will tell you that the parent of the i-th node is a_i (1 ≤ a_i<i for 2 ≤ i ≤ n), and she will ask you to perform q queries of 2 types:

  1. She'll give you three integers l, r and x (2 ≤ l ≤ r ≤ n, 1 ≤ x ≤ 10^5). You need to replace a_i with max(a_i-x,1) for all i with l ≤ i ≤ r.
  2. She'll give you two integers u, v (1 ≤ u, v ≤ n). You need to find the [LCA](https://en.wikipedia.org/wiki/Lowest_common_ancestor) of nodes u and v (their lowest common ancestor).

Input

The first line contains two integers n and q (2≤ n,q ≤ 10^5) — the number of nodes and the number of queries, respectively.

The second line contains n-1 integers a_2, a_3,..., a_n (1 ≤ a_i < i), where a_i is the parent of the node i.

Next q lines contain queries. For each query, the first integer of each line is t (t = 1 or 2) — the type of the query. 

If t = 1, this represents the query of the first type. Then, three integers will follow: l, r, x (2 ≤ l ≤ r ≤ n, 1 ≤ x ≤ 10^5), meaning that you have to replace a_i with max(a_i-x,1) for all i with l ≤ i ≤ r.

If t = 2, this represents the query of the second type. Then, two integers will follow: u and v (1 ≤ u, v ≤ n), and you have to find the LCA of u and v. 

It's guaranteed that there is at least one query of the second type.

Output

For each query of the second type output answer on a new line.

Example

Input


6 4
1 2 3 3 4
2 3 4
1 2 3 1
2 5 6
2 2 3


Output


3
3
1

Note

The tree in example is shown below.

<image>

After the query of the first type, the tree changes and is looking as shown below.

<image>
#include<bits/stdc++.h>
using namespace std;
#define N 100010
#define B 400
typedef long long ll;
inline ll read(){
	ll x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=(x<<1)+(x<<3)+c-'0';
		c=getchar();
	}
	return x*f;
}
int n,a[N],Q;
int L[B],R[B],len,blocks,pos[N],f[N];
int add[N];
int nd[N];
void Renew(int x){
	nd[x]=0;
	for(int i=L[x];i<=R[x];++i){
		a[i]=max(a[i]-add[x],1);
		f[i]=(a[i]<L[x]?a[i]:f[a[i]]);
		nd[x]|=f[i]!=a[i];
	}
	add[x]=0;
}
void Change(int l,int r,int w){
	int x=pos[l],y=pos[r];
	if(x==y){
		for(int i=l;i<=r;++i)a[i]=max(a[i]-w,1);
		Renew(x);
	}
	else{
		for(int i=l;i<=R[x];++i)a[i]=max(a[i]-w,1);
		for(int i=L[y];i<=r;++i)a[i]=max(a[i]-w,1);
		Renew(x),Renew(y);
		for(int i=x+1;i<y;++i){
			add[i]+=w;
			if(nd[i])Renew(i);
		}
	}
}
inline int get_f(int x){
	return x==1?0:max(1,f[x]-add[pos[x]]);
}
int Query(int x,int y){
	while(get_f(x)^get_f(y)){
		if(get_f(x)<get_f(y))swap(x,y);
		x=get_f(x);
	}
	static int vis[N];
	static vector<int> bin;
	for(auto x:bin)vis[x]=0;
	bin.clear();
	Renew(pos[x]),Renew(pos[y]);
	int lim=get_f(x);
	while(x^lim){
		bin.push_back(x);
		vis[x]=1,x=a[x];	
	}
	vis[x]=1,bin.push_back(x);
	while(233){
		if(vis[y])return y;
		y=a[y];
	}
}
int main(){
	n=read(),Q=read();
	for(int i=2;i<=n;++i){
		a[i]=read();	
	}
	len=ceil(sqrt(n));
	blocks=n/len+(n%len!=0);
	for(int i=1;i<=blocks;++i){
		L[i]=max(2,(i-1)*len+1),R[i]=min(i*len,n);
		for(int j=L[i];j<=R[i];++j)pos[j]=i;
		Renew(i);
	}
	while(Q--){
		int opt=read();
		if(opt==1){
			int x=read(),y=read(),z=read();
			Change(x,y,z);
		}
		else{
			int u=read(),v=read();
			printf("%d\n",Query(u,v));
		}
	}
	return 0;
}


