#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while(c<'0'||c>'9')
{
c=getchar_unlocked();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf=1e9;
const int mod2=998244353;
const int mod1=998244353;
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c,d,e;
};
int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2;
int i,s10,s12;
int kk;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
// fin(task);
//fou(task);
#endif
NHP
/// cin>>s1;
//modwwe
phongbeo();
//checktime
}
ib dp[200001];
vector<int> v[200001];
void dfs(int x)
{ dp[x]={1,0};
for(auto f:v[x]){
dfs(f);
dp[x].a+=dp[f].a;
if(dp[x].b+dp[f].b+1<k)
dp[x].a--,dp[x].b=max(dp[x].b,dp[f].b+1);
else dp[x].b=min(dp[x].b,dp[f].b+1);
}
}
void phongbeo()
{
cin>>n>>k;
for(int i=2;i<=n;i++)
cin>>l,v[l+1].pb(i);
dfs(1);
cout<<dp[1].a;
}
/**
5
2
1 3 4 3
2 3 5 2
*/
