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;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)1e5 + 100;
const int K = 350;
int A[N];
int B[N];
int id[N];
int lef[N];
int rig[N];
int tot[N];
bool block[N];

void compute(int bl){
    if(tot[bl] >= K) return; // no need to recompute
    for(int i = lef[bl] ; i <= rig[bl]; i ++ ){
        if(A[i] - tot[bl] < lef[bl]){
            B[i]=i;
        }
        else{
            B[i]=B[A[i]-tot[bl]];
        }
    }
}

int gob(int idx){
    if(tot[id[idx]] >= K) return idx;
    return B[idx];
}

int main(){
    fastIO;
    int n, q;
    cin >> n >> q;
    int sz = K + 1;
    int cnt = 0;
    for(int i = 2; i <= n; i ++) {
        cin >> A[i];
        sz ++ ;
        if(sz > K){
            cnt ++ ;
            sz = 1;
            lef[cnt] = i;
        }
        rig[cnt]=i;
        id[i]=cnt;
    }
    for(int i = 2; i <= n; i ++ ){
        if(rig[id[i]] == i) compute(id[i]);
    }
    int typ;
    int li, ri, x;
    int lf, rf;
    for(int i = 1; i <= q; i ++ ){
        cin >> typ;
        if(typ == 1){
            cin >> li >> ri >> x;
            lf = li;
            rf = ri;
            while(li <= ri){
                if(lef[id[li]] == li && rig[id[li]] <= ri){
                    if(tot[id[li]] < n){
                        tot[id[li]] += x;
                        compute(id[li]);
                    }
                    li = rig[id[li]] + 1;
                }
                else{
                    A[li] = max(1, A[li] - x);
                    if(li == rig[id[li]] || li == rf) compute(id[li]);
                    li ++ ;
                }
            }
        }
        else{
            cin >> li >> ri;

            while(li != ri){
                if(li > ri) swap(li, ri);
                if(id[li] == id[ri]){
                    if(gob(li) == gob(ri)){
                        ri = max(1, A[ri] - tot[id[ri]]); // walk by one
                    }
                    else{
                        ri = gob(ri);
                        ri = max(1, A[ri] - tot[id[ri]]); // jump out of the block
                    }
                }
                else{
                    ri = gob(ri);
                    ri = max(1, A[ri] - tot[id[ri]]);
                }
            }
            cout << ri << "\n";
        }
    }
    return 0;
}
