#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, D;
if (!(cin >> N >> D)) return 0;
vector<vector<int>> adj(N);
for (int i = 1; i < N; ++i) {
int x;
cin >> x;
adj[i].push_back(x);
adj[x].push_back(i);
}
if (D == 1) {
cout << N << '\n';
return 0;
}
vector<int> depth(N, 0), parent(N, -1);
{
vector<int> st = {0};
parent[0] = -2;
while (!st.empty()) {
int u = st.back(); st.pop_back();
for (int v : adj[u]) if (v != parent[u]) {
parent[v] = u;
depth[v] = depth[u] + 1;
st.push_back(v);
}
}
}
int maxDepth = *max_element(depth.begin(), depth.end());
vector<vector<int>> byDepth(maxDepth + 1);
for (int v = 0; v < N; ++v)
byDepth[ depth[v] ].push_back(v);
vector<char> blocked(N, 0);
int answer = 0;
queue<pair<int,int>> q;
for (int d = maxDepth; d >= 0; --d) {
for (int v : byDepth[d]) {
if (blocked[v]) continue;
++answer;
blocked[v] = 1;
q.push({v, 0});
while (!q.empty()) {
auto [u, dist] = q.front();
q.pop();
if (dist + 1 >= D) continue;
for (int w : adj[u])
if (!blocked[w]) {
blocked[w] = 1;
q.push({w, dist + 1});
}
}
}
}
cout << answer << '\n';
return 0;
}
