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;
//dengyaotriangle!

const int blk=256;
const int maxn=100005+blk*2;

int n,q;
int top[maxn],fa[maxn],dlt[maxn];
bool typ[maxn];

int gtop(int x){
    if(x==0)return -1;
    int r=x/blk;
    if(typ[r])return max(0,fa[x]-dlt[r]);
    return top[x];
}
int gfa(int x){
    if(x==0)return -1;
    int r=x/blk;
    if(typ[r])return max(0,fa[x]-dlt[r]);
    return fa[x];
}
void upd(int id){
    if(typ[id])return;
    int l=id*blk,r=id*blk+blk;
    for(int i=l;i<r;i++)fa[i]=max(0,fa[i]-dlt[id]);
    dlt[id]=0;
    typ[id]=1;
    for(int i=l;i<r;i++){
        if(fa[i]<l)top[i]=fa[i];
        else top[i]=top[fa[i]],typ[id]=0;
    }
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    cin>>n>>q;
    fa[0]=0;
    for(int i=1;i<n;i++)cin>>fa[i],fa[i]--;
    for(int i=0;i*blk<n;i++)upd(i);
    while(q--){
        int op,x,y;
        cin>>op>>x>>y;x--;y--;
        if(op==1){
            int md;cin>>md;
            int rl=x/blk,rr=y/blk;
            if(rl==rr){
                for(int i=x;i<=y;i++)fa[i]-=md;
                upd(rl);
            }else{
                for(int i=rl+1;i<rr;i++){
                    dlt[i]+=md;
                    upd(i);
                }
                for(int i=x;i<(rl+1)*blk;i++)fa[i]-=md;
                upd(rl);
                for(int i=rr*blk;i<=y;i++)fa[i]-=md;
                upd(rr);
            }
        }else{
            while(gtop(x)!=gtop(y)){
                if(gtop(x)<gtop(y))swap(x,y);
                x=gtop(x);
            }
            while(x!=y){
                if(gfa(x)<gfa(y))swap(x,y);
                x=gfa(x);
            }
            cout<<x+1<<'\n';
        }
    }
    return 0;
}