#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int MAX_N = 100000 + 5;
const int lim = 17;

int N, Q, cnt[MAX_N][20], fa[MAX_N], son[MAX_N], bro[MAX_N], dfsn[MAX_N][2], Tm;
struct SegmentNode{
    ll sum, lazy;
}node[1 << 18];
ll f[MAX_N][20], val_in[MAX_N];

void segment_modify(int i, int l, int r, int ql, int qr, int v) {
    if (l < ql || r > qr) {
        int mid = l + r >> 1;
        if (ql <= mid) segment_modify(i << 1, l, mid, ql, qr, v);
        if (mid < qr) segment_modify(i << 1 | 1, mid + 1, r, ql, qr, v);
        node[i].sum = node[i << 1].sum + node[i << 1 | 1].sum + (r - l + 1ll) * node[i].lazy;
    }else {
        node[i].sum += (r - l + 1ll) * v;
        node[i].lazy += v;
    }
}

ll segment_query(int i, int l, int r, int ql, int qr, ll v = 0) {
    if (l < ql || r > qr) {
        ll res = 0;
        int mid = l + r >> 1;
        if (ql <= mid) res = segment_query(i << 1, l, mid, ql, qr, v + node[i].lazy);
        if (mid < qr) res += segment_query(i << 1 | 1, mid + 1, r, ql, qr, v + node[i].lazy);
        return res;
    }else {
        return node[i].sum + v * (r - l + 1);
    }
}

void dfs_init(int u) {
    dfsn[u][0] = ++ Tm;
    cnt[u][0] = 1;
    for (int v = son[u]; v; v = bro[v]) {
        dfs_init(v);
        for (int i = 1; i <= lim; i ++) cnt[u][i] += cnt[v][i - 1];
    }
    dfsn[u][1] = Tm;
}

void modify(int x, int y, int k) {
    if (k == 1) {
        segment_modify(1, 1, N, dfsn[x][0], dfsn[x][1], y);
        return ;
    }
    for (int i = 0, d = y; d; i ++, d /= k) {
        f[x][i] += d;
        val_in[x] += 1ll * d * cnt[x][i];
    }
}

ll query(int x) {
    ll res = val_in[x] + segment_query(1, 1, N, dfsn[x][0], dfsn[x][1]);
    for (int i = 1, u = fa[x]; u && i <= lim; i ++, u = fa[u]) {
        for (int j = 0; j + i <= lim; j ++) {
            res += f[u][i + j] * cnt[x][j];
        }
    }
    return res;
}

int main() {
    scanf("%d%d", &N, &Q);
    for (int i = 2; i <= N; i ++) {
        scanf("%d", fa + i);
        bro[i] = son[fa[i]];
        son[fa[i]] = i;
    }
    dfs_init(1);
    while (Q --) {
        int ty, x, y, k;
        scanf("%d%d", &ty, &x);
        if (ty == 1) {
            scanf("%d%d", &y, &k);
            modify(x, y, k);
        }else {
            printf("%lld\n", query(x));
        }
    }
    return 0;
}