#include <bits/stdc++.h>

using namespace std;

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c) {
    vector<int> colors;
    for (int i = 1; i < n; ++i) {
        colors.push_back(c[i]);
    }
    sort(colors.begin(), colors.end());
    colors.resize(unique(colors.begin(), colors.end()) - colors.begin());
    for (int i = 1; i < n; ++i) {
        c[i] = lower_bound(colors.begin(), colors.end(), c[i]) - colors.begin();
    }
    if (n <= 8) {
        vector<vector<int>> tree(n);
        for (int i = 0; i < n; ++i) {
            int nw = p[i];
            while (nw != -1) {
                tree[nw].push_back(i);
                nw = p[nw];
            }
        }
        vector<int> ans(n);
        for (int i = 0; i < n; ++i) {
            if (tree[i].empty()) {
                ans[i] = 1;
                continue;
            }
            do {
                map<int, int> cnt;
                bool check = true;
                for (auto v : tree[i]) {
                    if (cnt[c[v]] == 0 && p[v] != i) {
                        check = false;
                        break;
                    }
                    if (cnt[c[v]] > 0 && tree[i][cnt[c[v]] - 1] != p[v]) {
                        check = false;
                        break;
                    }
                    cnt[c[v]]++;
                }
                if (check) {
                    ans[i] = 1;
                }
            } while (next_permutation(tree[i].begin(), tree[i].end()));
        }
        return ans;
    }
    bool is_bamboo = true;
    for (int i = 1; i < n; ++i) {
        if (p[i] != i - 1) {
            is_bamboo = false;
        }
    }
    if (is_bamboo) {
        vector<int> ans(n);
        set<int> s;
        for (int i = n - 1; i >= 0; --i) {
            if (s.size() <= 1) {
                ans[i] = 1;
            }
            s.insert(c[i]);
        }
        return ans;
    }
}