#include <bits/stdc++.h>
#define rf(x) (x)=0;while(*p<48)p++;while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);
//#define rf(x) (x)=0;while(*p<48)im=*p=='-';while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);if(im)(x)=-(x);
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define cb(x) (x)=(!(x))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define INFST (0x7f7f7f7f)
#define INFLLST (0x7f7f7f7f7f7f7f7fll)
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
typedef complex<ld> base;
const ld EPS = (ld)1e-7;
const ld PI = acos(0) * 2;
bool isZero(const ld& x) { return abs(x) <= EPS; }
int sign(const ld& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
ll gcd(ll a, ll b) { for(;b;a%=b,swap(a,b)){} return abs(a); }
pll operator + (const pll& a, const pll& b) { return pll(a.first+b.first, a.second+b.second); }
pll operator - (const pll& a, const pll& b) { return pll(a.first-b.first, a.second-b.second); }
pll operator * (const pll& a, const ll& b) { return pll(a.first*b, a.second*b); }
ll operator * (const pll& a, const pll& b) { return a.first*b.second - b.first*a.second; }
ll ccw(const pll& a, const pll& b, const pll& c) { return a*b + b*c + c*a; }
int rd(int s, int e) { return rand()%(e-s+1) + s; }
void fg(vector<int> G[], int a, int b) { G[a].pb(b); G[b].pb(a); }
void fg(vector<pii> G[], int a, int b, int c) { G[a].pb({b, c}); G[b].pb({a, c}); }

const int MAXN = 100005;

struct BIT {
	int d[MAXN];
	void upd(int x, int r) {
		for(; x < MAXN; x += rb(x))
			d[x] += r;
	}
	int get(int x) {
		int r = 0;
		for(; x; x -= rb(x))
			r += d[x];
		return r;
	}
} bit;

vector<int> G[MAXN];

int prt[MAXN][17], cnt[MAXN], dep[MAXN], di[MAXN];
int A[MAXN], O[MAXN];

int N, K, Ans;

int upf(int i, int n) {
	for(int j = 0; j < 17; j++) if(n & (1<<j))
		i = prt[i][j];
	return i;
}

void f(int i, int &c) {
	cnt[i] = 1; di[i] = ++c;
	for(int v : G[i]) {
		dep[v] = dep[i] + 1;
		f(v, c);
		cnt[i] += cnt[v];
	}
}

int main() {
	ios::sync_with_stdio(false);
	
	cin >> N >> K;
	for(int i = 1; i <= N; i++) cin >> A[i];

	if(A[1] != 1) {
		Ans++;
		A[1] = 1;
	}

	if(N-1 <= K) {
		cout << Ans << endl;
		return 0;
	}

	for(int i = 1; i <= N; i++)
		prt[i][0] = A[i];
	for(int j = 1; j < 17; j++) for(int i = 1; i <= N; i++)
		prt[i][j] = prt[prt[i][j-1]][j-1];
	
	for(int i = 2; i <= N; i++) G[A[i]].pb(i);

	{
		int c = 0;
		dep[1] = 1;
		f(1, c);
	}

	iota(O, O+N+1, 0);
	sort(O+1, O+N+1, [&](int a, int b){
		return dep[a] > dep[b];
	});

	for(int oi = 1, i; oi <= N; oi++) {
		i = O[oi];
		if(1 == upf(i, K) || bit.get(di[i])) continue;

		int p = upf(i, K-1);
		Ans++;

		bit.upd(di[p], 1);
		bit.upd(di[p] + cnt[p], -1);
	}

	cout << Ans << endl;
	return 0;
}

Measured memory_bytes: 19456