/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 1e5 + 5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;

int n, q;
vector<int> adj[N];
int in[N], out[N], dfsTimer;
ll t[N << 2], lz[N << 2];

void push(int node, int s, int e) {
    t[node] += lz[node] * (e - s + 1);
    if (s != e) {
        lz[node << 1] += lz[node];
        lz[node << 1 | 1] += lz[node];
    }
    lz[node] = 0;
}

void pull(int node) {
    t[node] = t[node << 1] + t[node];
}

void update(int node, int s, int e, int l, int r, ll val) {
    push(node, s, e);
    if (r < s || e < l)return;
    if (l <= s && e <= r) {
        lz[node] += val;
        push(node, s, e);
        return;
    }
    int md = (s + e) >> 1;
    update(node << 1, s, md, l, r, val);
    update(node << 1 | 1, md + 1, e, l, r, val);
    pull(node);
}

int query(int node, int s, int e, int l, int r) {
    push(node, s, e);
    if (r < s || e < l)return 0;
    if (l <= s && e <= r)return t[node];
    int md = (s + e) >> 1;
    return query(node << 1, s, md, l, r)
           + query(node << 1 | 1, md + 1, e, l, r);
}

ll sum[N][20];

void dfs(int node) {
    in[node] = ++dfsTimer;
    sum[node][0] = 1;
    for (auto v: adj[node]) {
        dfs(v);
        f(i, 1, 20)sum[node][i] += sum[v][i - 1];
    }
    out[node] = dfsTimer;
}

int cnt[N][20];
int par[N];

void doWork() {
    cin >> n >> q;
    f(i, 2, n + 1) {
        int p;
        par[i] = p;
        cin >> p;
        adj[p].push_back(i);
    }
    dfs(1);
    while (q--) {
        int tp, x;
        cin >> tp >> x;
        if (tp == 1) {
            int y, k;
            cin >> y >> k;
            if (k == 1)update(1, 1, n, in[x], out[x], y);
            else {
                ll tot = 0;
                f(p, 0, 20) {
                    tot += y * sum[x][p];
                    cnt[x][p] += y;
                    y /= k;
                }
                update(1, 1, n, in[x], in[x], tot);
            }
        } else {
            ll ans = query(1, 1, n, in[x], out[x]);
            int cur = x;
            f(p, 1, 20) {
                cur = par[cur];
                f(i, 0, 20 - p) {
                    ans += cnt[cur][i + p] * sum[x][i];
                }
            }
            cout << ans << '\n';
        }

    }
}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}