//header
#ifdef LOCAL
    #include "cxx-prettyprint-master/prettyprint.hpp"
    #define print(x) cout << x << endl
#else
    #define print(...) 42
#endif
    #pragma GCC optimize("Ofast")
    #include <bits/stdc++.h>
    //types
    using namespace std;
    using ll = long long;
    typedef pair < ll , ll >Pl;
    typedef pair < int, int >Pi;
    typedef vector<ll> vl;
    typedef vector<int> vi;
    template< typename T >
    using mat = vector< vector< T > >;
    template <std::uint_fast64_t Modulus> class modint {

        using u64 = std::uint_fast64_t;

        public:
        u64 a;

        constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
        constexpr u64 &value() noexcept { return a; }
        constexpr const u64 &value() const noexcept { return a; }
        constexpr modint operator+(const modint rhs) const noexcept {
            return modint(*this) += rhs;
        }
        constexpr modint operator-(const modint rhs) const noexcept {
            return modint(*this) -= rhs;
        }
        constexpr modint operator*(const modint rhs) const noexcept {
            return modint(*this) *= rhs;
        }
        constexpr modint operator/(const modint rhs) const noexcept {
            return modint(*this) /= rhs;
        }
        constexpr modint &operator+=(const modint rhs) noexcept {
            a += rhs.a;
            if (a >= Modulus) {
            a -= Modulus;
            }
            return *this;
        }
        constexpr modint &operator-=(const modint rhs) noexcept {
            if (a < rhs.a) {
            a += Modulus;
            }
            a -= rhs.a;
            return *this;
        }
        constexpr modint &operator*=(const modint rhs) noexcept {
            a = a * rhs.a % Modulus;
            return *this;
        }
        constexpr modint &operator/=(modint rhs) noexcept {
            u64 exp = Modulus - 2;
            while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
            }
            return *this;
        }
        };
    
    
    
    
    
    //abreviations
    #define all(x) (x).begin(), (x).end()
    #define rall(x) (x).rbegin(), (x).rend()
    #define rep2(i,a,b) for(int i=(a);i<(b);++i)
    #define rep(i,n) for(int i=0;i<(n);++i)
    #define rev(i,n) for(int i=n-1;i>=0;i--)
    #define SZ(x) ((ll)(x).size())
    #define pb(x) push_back(x)
    #define ff first
    #define ss second
    #define mp make_pair
    //functions
    ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
    template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
    template< typename T >
    T mypow(T x, ll n) {
        T ret = 1;
        while(n > 0) {
            if(n & 1) (ret *= x);
            (x *= x);
            n >>= 1;
        }
        return ret;
    }
    uint64_t my_rand(void) {
        static uint64_t x = 88172645463325252ULL;
        x = x ^ (x << 13); x = x ^ (x >> 7);
        return x = x ^ (x << 17);
    }
    //graph template
    template< typename T >
    struct edge {
        int src, to;
        T cost;

        edge(int to, T cost) : src(-1), to(to), cost(cost) {}

        edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

        edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    operator int() const { return to; }
    };

    template< typename T >
    using Edges = vector< edge< T > >;
    template< typename T >
    using WeightedGraph = vector< Edges< T > >;
    using UnWeightedGraph = vector< vector< int > >;

//constant
#define INF 10000000000LL
#define mod 1000000007LL
//typedef modint<mod> mint;
#define eps 0.000001
//library
int ans = 0;
mat<int>g;
vi dep;
vector<bool> used;
void dfs(int v, int p, int d){
    dep[v] = d;
    for(auto nv:g[v]){
        if(nv == p)continue;
        dfs(nv, v, d+1);
    }
}
void check(int v){
    if(used[v]) return;
    used[v] = true;
    for(auto nv:g[v]){
        if(dep[nv]<dep[v])continue;
        check(nv);
    }
}
//main
int main(){
    ll n, k; cin>>n>>k;
    g.resize(n);
    dep.resize(n);
    used.resize(n);
    vi a(n);
    cin>>a[0];
    a[0]--;
    if(a[0] != 0)ans++;
    rep2(i, 1, n){
        cin>>a[i];
        a[i]--;
        g[i].pb(a[i]); g[a[i]].pb(i);
    }
    dfs(0, 0, 0);
    vi index(n); iota(all(index), 0);
    sort(all(index), [](int a, int b){return dep[a]>dep[b];});
    for(int v:index){
        if(used[v])continue;
        int d = dep[v];
        if(d>k){
            int p = v;
            while((dep[v]-dep[p])<k-1&&p!=0){
                p = a[p];
            }
            check(p);
            ans++;
        }
    }
    cout << ans << endl;
}    

Measured memory_bytes: 9728