#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

const int maxn = 100010;
const int M = 18;

template <typename T>
struct BIT {
    int n;
    T tr1[maxn], tr2[maxn];

    void init(int _n) {
        n = _n;
        for (int i = 0; i <= n; i++) {
            tr1[i] = tr2[i] = T();
        }
    }

    inline int lowbit(int x) { return x & -x; }

    void add(int x, T c) {
        for (int i = x; i <= n; i += lowbit(i)) tr1[i] += c;
        for (int i = x; i <= n; i += lowbit(i)) tr2[i] += x * c;
    }

    void modify(int l, int r, T c) {
        add(l, c);
        if (r + 1 <= n) add(r + 1, -c);
    }

    T query1(int x) {
        T res = T();
        for (int i = x; i; i -= lowbit(i)) res += tr1[i];
        return res;
    }

    T query2(int x) {
        T res = T();
        for (int i = x; i; i -= lowbit(i)) res += tr2[i];
        return res;
    }

    T query_cf(int x) { return (x + 1) * query1(x) - query2(x); }

    T query_cf(int l, int r) { return query_cf(r) - query_cf(l - 1); }

    T query(int l, int r) { return query1(r) - query1(l - 1); }
};

int n, q, tot;
int dep[maxn], p[maxn], lid[maxn], rid[maxn], son[maxn][M + 1],
    tag[maxn][M + 1];
vector<int> e[maxn];
BIT<int> b1, b2;

void dfs(int u, int f) {
    lid[u] = ++tot;
    son[u][0] = 1;
    dep[u] = dep[f] + 1;
    for (int v : e[u]) {
        dfs(v, u);
        for (int i = 1; i <= M; i++) son[u][i] += son[v][i - 1];
    }
    rid[u] = tot;
}

void addtag(int u, int x, int k) {
    if (k == 1) {
        b1.modify(lid[u], rid[u], x);
        return;
    }
    int add = 0;
    for (int i = 0; i <= M; i++) {
        add += son[u][i] * x;
        tag[u][i] += x;
        x /= k;
    }
    b2.add(lid[u], add);
}

int calc(int u) {
    int res = b1.query(lid[u], rid[u]) + b2.query(lid[u], rid[u]);
    int v = p[u];
    while (v) {
        if (dep[v] + 18 < dep[u]) break;
        for (int i = 0; dep[v] + 18 >= dep[u] + i; i++) {
            res += son[u][i] * tag[v][i + dep[u] - dep[v]];
        }
        v = p[v];
    }
    return res;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> q;
    for (int i = 2; i <= n; i++) {
        cin >> p[i];
        e[p[i]].push_back(i);
    }
    dfs(1, 0);
    b1.init(n);
    b2.init(n);
    while (q--) {
        int ty;
        cin >> ty;
        if (ty == 1) {
            int u, x, k;
            cin >> u >> x >> k;
            addtag(u, x, k);
        } else {
            int u;
            cin >> u;
            cout << calc(u) << endl;
        }
    }
}