#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=2e5+5;
const int inf=1e9;
int d;
int level[mxn];
set<pii> st;
vector<int> adj[mxn];
int par[mxn];
int near[mxn];
void dfs(int cur,int prev,int dist,int x) {
if(dist >= d) return;
if(st.find({level[cur],cur}) != st.end()) st.erase({level[cur],cur});
for(int u : adj[cur]) {
if(u == prev || (cur == x && level[u] > level[cur]) ) continue;
dfs(u,cur,dist + 1,x);
}
}
bool check(int cur,int dist) {
if(dist >= d) return true;
if(dist + near[cur] < d) return false;
if(par[cur] == cur) return true;
return check(par[cur],dist + 1);
}
void update(int cur,int dist) {
if(dist >= d) return;
near[cur] = min(near[cur],dist);
update(par[cur],dist + 1);
}
void DFS(int cur,int prev) {
level[cur] = level[prev] + 1;
par[cur] = prev;
for(int u : adj[cur]) {
if(u != prev) DFS(u,cur);
}
}
int main() {
int n;
cin>>n;
cin>>d;
for(int i = 1; i < n; i++) {
int u;
cin>>u;
adj[u].push_back(i);
adj[i].push_back(u);
}
for(int i = 0; i <= n; i++) near[i] = inf;
level[0] = 0;
DFS(0,0);
vector<pii> v;
for(int i = 0; i < n; i++) v.push_back({level[i],i});
sort(v.begin(),v.end());
int res = 0;
for(int i = v.size() - 1; i >= 0; i--) {
int u = v[i].second;
bool f = check(u,0);
if(f) {
res++;
update(u,0);
}
}
cout<<res<<endl;
}
