# include <bits/stdc++.h>
# define ll long long
# define fi first
# define se second
# define pii pair<int, int>
using namespace std;

vector<int> edge[200001];
int dpt[200001];

int main() {
	int N, D;
	scanf("%d %d", &N, &D);
	
	vector< pii > arr(N);
	arr[0] = {0, 0};
	for(int i=1;i<N;i++) {
		int x;
		scanf("%d", &x);
		edge[i].push_back(x);
		edge[x].push_back(i);
		
		arr[i].fi = arr[x].fi - 1;
		arr[i].se=  i;
	}
	sort(arr.begin(), arr.end());
	
	for(int i=0;i<N;i++) dpt[i] = -1e9;
	
	int ans = 0;
	for(int i=0;i<N;i++) {
		if(dpt[arr[i].se] == -1e9) {
			ans++;
			
			queue<int> bfs;
			dpt[arr[i].se] = 0;
			bfs.push(arr[i].se);
			
			while(bfs.size()) {
				int x = bfs.front();
				bfs.pop();
				
				if(dpt[x] == D - 1) continue;
				
				for(auto p : edge[x]) {
					if(dpt[p] == -1e9) {
						dpt[p] = dpt[x] + 1;
						bfs.push(p);
					}
				}
			}
		}
	}
	
	printf("%d\n", ans);
}