#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

vector<vector<int>> edge1;
vector<int> edge2,come,dist;

void dfs(int curr,int prev){
	for(int next:edge1[curr]) {
		if(next == prev) continue;
		dist[next] = dist[curr]+1;
		dfs(next,curr);
	}
}

int main() {
	int N,K; cin >> N >> K;
	edge1.resize(N);
	edge2.resize(N);
	come.resize(N,0);
	dist.resize(N);

	int ans = 0;
	cin >> ans; ans--;
	ans = !!ans;
	for(int i = 1; i < N; ++i) {
		int p;
		cin >> p;
		p--;
		edge1[p].push_back(i);
		edge2[i] = p;
		come[p]++;
	}

	dist[0] = 0;
	dfs(0,-1);

	vector<int> cnt(N,0);
	queue<int> q;
	for(int i = 0; i < N; ++i) {
		if(!come[i]) {
			q.push(i);
			if(dist[i]>K) cnt[i] = 1;
		}
	}
	while(q.size()){
		int curr = q.front();
		q.pop();
		if(curr==0) continue;
		int next = edge2[curr];
		come[next]--;

		if(cnt[curr]) {
			if(cnt[curr]<K) {
				chmax(cnt[next],cnt[curr]+1);
			}
			else{
				if(dist[next]>K) chmax(cnt[next],1);
				ans++;
			}
		}

		if(!come[next]) q.push(next);
	}
	cout << ans << endl;


    return 0;
}


Measured memory_bytes: 12032