#include<bits/stdc++.h>
# define rep(i, j, k) for (int i = j; i <= k; ++i)
# define N 100005
using namespace std;

int n, q, p[N];
int d[N], maxx, cnt[N], num[N], le[N], re[N];
int rd, pre[505][2 * N], tot, len[505], dp[505], sp[505], bg[505];
int x[N], ans[N];
void add(int x, int y, int z){pre[x][y - bg[x] + q - rd] += z;}
int main()
{
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	rep(i, 1, 100000) le[i] = 10000000;
	cin >> n >> q;
	rep(i, 2, n) cin >> p[i];
	rep(i, 1, n) d[i] = d[p[i]] + 1, num[i] = cnt[d[i]]++, le[p[i]] = min(le[p[i]], i), re[p[i]] = max(re[p[i]], i);
	maxx = d[n];
	int tmp = 1;
	rep(i, 1, maxx)
	{
		if (cnt[i] != cnt[i - 1])
		{
			rep(i, bg[tot], tmp - 1) x[i] = tot;
			sp[tot++] = i - 1, len[tot] = cnt[i], dp[tot] = i, bg[tot] = tmp;
		}
		tmp += cnt[i];
	}
	rep(i, bg[tot], n) x[i] = tot;
	sp[tot] = maxx;
	for (int i = n; i; --i) if (x[i] != tot) while (x[le[i]] == x[i]) le[i] = le[le[i]], re[i] = re[re[i]];
	rep(e, 1, q)
	{
		int op; cin >> op;
		if (op == 1)
		{
			int s, t; cin >> s >> t;
			int l = s, r = s;
			while (true)
			{
				int tmp = x[l];
				add(tmp, l, t), add(tmp, r + 1, -t), add(tmp, l + len[tmp] * (sp[tmp] - d[l] + 1), -t), add(tmp, r + len[tmp] * (sp[tmp] - d[l] + 1) + 1, t);
				if (tmp == tot) break;
				l = le[l], r = re[r];
			}
		}
		else ++rd;
	}
	rep(i, 1, tot)
	{
		rep(j, 1, n + q) pre[i][j] += pre[i][j - 1];
		rep(j, len[i], n + q) pre[i][j] += pre[i][j - len[i]];
		rep(j, 1, n + q) ans[(bg[i] + j - q + 3 * n - 1) % n + 1] += pre[i][j];
	}
	int as = 0;
	rep(i, 1, n) as ^= ans[i];
	cout << as << '\n';
	return 0;
}