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>
#pragma GCC optimize("Ofast", "unroll-loops", "no-stack-protector")
 
#include <bits/stdc++.h>
 
using namespace std;

#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()

using ll = long long;
using ld = long double; 
// using ld = __float128;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using uint = unsigned int;
using ull = unsigned long long;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
default_random_engine generator;

void solve();

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout); 
#endif 

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << setprecision(10) << fixed;
    cerr << setprecision(10) << fixed;

    int tests = 1;
    // cin >> tests;

    for (int test = 1; test <= tests; ++test) {
        // cout << "Case #" << test << ": ";
        solve();
    }

#ifdef LOCAL
    cerr << "Time: " << double(clock()) / CLOCKS_PER_SEC << endl;
#endif
}

// ----------------------------------------------------------------- 

void solve() {  
    int n, q;
    cin >> n >> q;
    vector<int> p(n);
    for (int i = 1; i < n; ++i) {
        cin >> p[i];
        --p[i];
    }
    int block = sqrtl(n);

    int m = (n + block - 1) / block;

    vector<int> f(n);
    for (int i = 1; i < n; ++i) {
        f[i] = (i / block == p[i] / block ? f[p[i]] : p[i]);
    }

    vector<int> final(m, false), g(m);
    auto update = [&](int l, int r, int id, int a) {
        int lf = id * block, rg = min(n, (id + 1) * block);
        if (final[id]) {
            if (l <= lf && rg <= r) {
                g[id] = min(g[id] + a, n);
            } else {
                for (int i = max(l, lf); i < min(r, rg); ++i) {
                    p[i] = max(p[i] - a, 0);
                }
            }
            return;
        }

        for (int i = max(l, lf); i < min(r, rg); ++i) {
            p[i] = max(p[i] - a, 0);
        }
        final[id] = true;
        for (int i = lf; i < rg; ++i) {
            final[id] &= p[i] / block != id;
            f[i] = (i / block == p[i] / block ? f[p[i]] : p[i]);
        }
    };

    while (q--) {
        int t;
        cin >> t;

        if (t == 1) {
            int l, r, a;
            cin >> l >> r >> a;
            --l;
            for (int i = l / block; i <= (r - 1) / block; ++i) {
                update(l, r, i, a);
            }
        } else {
            int u, v;
            cin >> u >> v;
            --u; --v;

            while (u != v) {
                if (u > v) {
                    swap(u, v);
                }
                if (!final[v / block] && (u / block != v / block || f[u] != f[v])) {
                    v = max(0, f[v]);
                } else {
                    v = max(0, p[v] - g[v / block]);
                }
            }

            cout << u + 1 << "\n";
        }
    }

}

