/*input
8 5
3
1
-1
5
7
5
3
7
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mxh = 27;
vector<pair<int, int>> dp[505050][mxh];
vector<int>ch[505050];
int pa[505050];
int h[505050];
int sz[505050];
vector<pair<int, int>>suma( vector<pair<int, int>> & a,  vector<pair<int, int>> & b)
{
	if (a.empty() || b.empty())
		return {};
	vector<pair<int, int>>c;
	if (a.size() + b.size() >= 3)
	{
		return {{a[0].first + b[0].first, a.back().second + b.back().second}};
	}
	int x = 1e8;
	int y = -1;
	for (pair<int, int>i : a)
	{
		for (pair<int, int>j : b)
		{
			x = min(x, i.first + j.first);
			y = max(y, i.second + j.second);
		}
	}
	return {{x, y}};
	//sort(c.begin(), c.end());
	//return fix(c);
}
vector<pair<int, int>>pluss( vector<pair<int, int>> &a)
{
	vector<pair<int, int>>r;
	for (pair<int, int>i : a) {
		r.push_back({i.first + 1, i.second + 1});
	}
	return r;
}
void merge( vector<pair<int, int>> & a,
            vector<pair<int, int>> & b,
            vector<pair<int, int>> & c,
            vector<pair<int, int>> & r)
{
	if (a.size() + b.size() + c.size() >= 4)
	{
		int x = 1e8;
		int y = -1;
		if (!a.empty())
		{
			x = min(x, a[0].first);
			y = max(y, a.back().second);
		}
		if (!b.empty())
		{
			x = min(x, b[0].first);
			y = max(y, b.back().second);
		}
		if (!c.empty())
		{
			x = min(x, c[0].first);
			y = max(y, c.back().second);
		}
		r = {{x, y}};
		return;
	}
	r.clear();
	int i = 0;
	int j = 0;
	int k = 0;
	int d = -100;
	auto add = [&](pair<int, int>i)
	{
		if (i.first <= d)
		{
			r.back().second = max(r.back().second, i.second + 1);
		}
		else
		{
			r.push_back({i.first + 1, i.second + 1});
		}
		d = r.back().second;
	};
	while (i < a.size() && j < b.size() && k < c.size())
	{
		if (a[i] <= b[j])
		{
			if (a[i] <= c[k])
			{
				add(a[i++]);
			}
			else
			{
				add(c[k++]);
			}
		}
		else
		{
			if (b[j] <= c[k])
			{
				add(b[j++]);
			}
			else
			{
				add(c[k++]);
			}
		}
	}
	while (j < b.size() && k < c.size())
	{
		if (b[j] < c[k])
		{
			add(b[j++]);
		}
		else
		{
			add(c[k++]);
		}
	}
	while (i < a.size() && k < c.size())
	{
		if (a[i] < c[k])
		{
			add(a[i++]);
		}
		else
		{
			add(c[k++]);
		}
	}
	while (i < a.size() && j < b.size())
	{
		if (a[i] < b[j])
		{
			add(a[i++]);
		}
		else
		{
			add(b[j++]);
		}
	}
	while (i < a.size())
		add(a[i++]);
	while (j < b.size())
		add(b[j++]);
	while (k < c.size())
		add(c[k++]);
}
void prec(int v)
{
	sz[v] = 1;
	h[v] = 1;
	for (int w : ch[v])
	{
		prec(w);
		sz[v] += sz[w];
		h[v] = max(h[v], h[w] + 1);
	}
	dp[v][0] = {{0, 0}};
	dp[v][1] = {{1, 1}};
	if (ch[v].size() == 1)
	{
		dp[v][2] = {{2, 2}};
	}
	if (ch[v].size() == 2)
	{
		int &l = ch[v][0];
		int &r = ch[v][1];
		if (l > r)
			swap(l, r);
		for (int i = 2; i <= h[v]; i++)
		{
			auto v1 = suma(dp[l][i - 1], dp[r][i - 1]);
			auto v2 = suma(dp[l][i - 1], dp[r][i - 2]);
			auto v3 = suma(dp[l][i - 2], dp[r][i - 1]);
			merge(
			    v1, v2, v3, dp[v][i]
			);
		}
	}
}
int K[505050];
int NE[505050];
int n;
int k;
int r = 1;
void blogas(int i)
{
	if (NE[i])
		return;
	NE[i] = 1;
	for (int j : ch[i])
	{
		blogas(j);
	}
}
void check(int i)
{
	if (K[i] == 1 || NE[i] == 1)
		return;
	vector<int>nauji;
	vector<int>check;
	int j = i;
	while (j != -1)
	{
		if (K[j] == 0)
			nauji.push_back(j);
		check.push_back(j);
		j = pa[j];
	}
	for (int x : nauji)
	{
		K[x] = 1;
	}
	for (int v : check)
	{
		for (int i = 0; i < mxh; i++)
		{
			dp[v][i] = {};
		}
		if (ch[v].size() == 0)
		{
			dp[v][1] = {{1, 1}};
		}
		if (ch[v].size() == 1)
		{
			int w = ch[v][0];
			dp[v][1] = pluss(dp[w][0]);
			dp[v][2] = pluss(dp[w][1]);
		}
		if (ch[v].size() == 2)
		{
			int l = ch[v][0];
			int r = ch[v][1];
			auto v4 = suma(dp[l][0], dp[r][0]);
			dp[v][1] = pluss(v4);
			for (int i = 2; i <= h[v]; i++)
			{
				auto v1 = suma(dp[l][i - 1], dp[r][i - 1]);
				auto v2 = suma(dp[l][i - 1], dp[r][i - 2]);
				auto v3 = suma(dp[l][i - 2], dp[r][i - 1]);
				merge(
				    v1, v2, v3, dp[v][i]
				);
			}
		}
	}
	bool ok = false;
	for (int h = 0; h < mxh; h++)
		for (pair<int, int>a : dp[r][h])
			if (a.first <= k && k <= a.second)
				ok = true;
	if (ok)
		return;
	for (int x : nauji)
	{
		K[x] = 0;
	}
	for (int v : check)
	{
		for (int i = 0; i < mxh; i++)
		{
			dp[v][i] = {};
		}
		if (K[v] == 0)
		{
			dp[v][0] = {{0, 0}};
		}
		else
		{
			if (ch[v].size() == 0)
			{
				dp[v][1] = {{1, 1}};
			}
			if (ch[v].size() == 1)
			{
				int w = ch[v][0];
				dp[v][1] = pluss(dp[w][0]);
			}
			if (ch[v].size() == 2)
			{
				int l = ch[v][0];
				int r = ch[v][1];
				auto v4 = suma(dp[l][0], dp[r][0]);
				dp[v][1] = pluss(v4);
				for (int i = 2; i <= h[v]; i++)
				{
					auto v1 = suma(dp[l][i - 1], dp[r][i - 1]);
					auto v2 = suma(dp[l][i - 1], dp[r][i - 2]);
					auto v3 = suma(dp[l][i - 2], dp[r][i - 1]);
					merge(
					    v1, v2, v3, dp[v][i]
					);
				}
			}
		}
	}
	blogas(i);
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
	{
		cin >> pa[i];
		if (pa[i] == -1)
			r = i;
		else
			ch[pa[i]].push_back(i);
	}
	prec(r);
	for (int i = 1; i <= n; i++)
	{
		check(i);
	}
	for (int i = 1; i <= n; i++)
	{
		cout << "01"[K[i]];
	}
}