#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=1e6+100,L=21,bs=701;
int A[N],B[N],D[N],E[N],n,m,k,dp[N],pre[N],h[N],vis[N],ans,d;
vector<int>g[N];
set<pii>C;
void dfs(int v,int dd=d){
vis[v]=1;
C.erase({h[v],v});//cout<<v<<endl;
if(dd==0)return;
dd--;
for(int u:g[v])if(vis[u]==0)dfs(u,dd);
}
int main(){
fast_io
cin>>n>>d;C.insert({0,0});d--;
for(int i=1;i<=n-1;i++){
int p;cin>>p;
h[i]=h[p]+1;
g[p].pb(i);
g[i].pb(p);
C.insert({h[i],i});
}
while(C.size()){
auto x=C.end();x--;
int v=(*x).S;
ans++;
dfs(v);
}
cout<<ans<<endl;
}
