// Starcraft 2 enjoyer //
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define LSOne(X) ((X) & -(X))
#define int long long
const int N = 2e5 + 5;
const int M = 1 << 15;
const int B = 18;
const long long K = 2;
const int LG = 20;
const int INF = 1e9 + 5;
const int P = 31;
const int MOD = 1e9 + 7;
const int nx[] = {0, 1, 0, -1}, ny[] = {-1, 0, 1, 0};
int n, d, dp[N], dis[N];
vector<int> adj[N];
void dfs(int c, int p)
{
int mx = -1, mx2 = -1;
int sum = 0;
for (int i : adj[c])
{
if (i == p)
continue;
dfs(i, c);
if (dis[i] + 1 > d / 2)
{
sum += dp[i];
mx2 = max(mx2, dis[i] + 1);
}
else
{
sum += dp[i] - 1;
mx = max(mx, dis[i] + 1);
}
}
// cout << mx << " " << sum << " " << c << "w\n";
if (mx == -1) // no
{
dp[c] = sum;
dis[c] = mx2;
}
else
{
dp[c] = sum + 1;
dis[c] = mx;
}
if (adj[c].size() == 1 && c != p)
{
dp[c] = 1;
dis[c] = 0;
}
if (dis[c] == d)
{
dis[c] = 0;
dp[c]++;
}
// cout << dis[c] << " " << dp[c] << " " << c << "\n";
}
inline void solve()
{
cin >> n >> d;
for (int x = 1; x < n; x++)
{
int i;
cin >> i;
adj[x].push_back(i);
adj[i].push_back(x);
}
dfs(0, 0);
cout << dp[0];
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
for (int x = 1; x <= t; x++)
{
solve();
}
return 0;
}
