// Original C++ solution (slower):
// includes

#include <bits/stdc++.h>

using namespace std;



// macros

#define pb emplace_back

#define mk make_pair

#define FOR(i, a, b) for(int i=(a);i<(b);++i)

#define rep(i, n) FOR(i, 0, n)

#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)

#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)

#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)

#define whole(x) (x).begin(),(x).end()

#define sz(x) ((int)(x).size())

#define bit(n) (1LL<<(n))

// functions

template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}

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(a > b){a = b; return 1;} return 0;}

template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}

template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}

template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}

template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}

template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}

template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}

template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types

using ll = long long int;

using P = pair<int, int>;

// constants

const int inf = 1e9;

const ll linf = 1LL << 50;

const double EPS = 1e-10;

const int mod = 1000000007;

const int dx[4] = {-1, 0, 1, 0};

const int dy[4] = {0, -1, 0, 1};

// io

struct fast_io{

  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}

} fast_io_;



vector<int> edge[100010], child[100010];

int h[100010], par[100010];



void dfs(int i, int p){

  for(auto e: edge[i]){

    if(e == p)continue;

    par[e] = i;

    child[i].pb(e);

    h[e] = h[i] + 1;

    dfs(e, i);

  }

}



int main(int argc, char const* argv[])

{

  int n, k; cin >> n >> k;

  vector<int> a(n); cin >> a;

  if(k == 1){

    int res = 0;

    rep(i, n)res += (a[i] != 1);

    cout << res << endl;

    return 0;

  }

  rep(i, n)a[i]--;

  FOR(i, 1, n){

    edge[i].pb(a[i]);

    edge[a[i]].pb(i);

  }

  dfs(0, -1);

  int res = (a[0] != 0);

  priority_queue<P> pq;

  FOR(i, 1, n){

    pq.push(mk(h[i], i));

  }

  vector<bool> used(n, false); used[0] = true;

  while(!pq.empty()){

    auto p = pq.top(); pq.pop();

    int hei = p.first, idx = p.second;

    if(used[idx])continue;

    if(hei <= k)break;

    int r = idx;

    ++res;

    rep(j, k - 1){

      r = par[r];

    }

    stack<int> st; st.push(r);

    while(!st.empty()){

      int to = st.top(); st.pop();

      if(used[to])continue;

      used[to] = true;

      for(auto e: child[to]){

        if(!used[e])st.push(e);

      }

    }

  }

  cout << res << endl;

  return 0;

}


// Optimized solution to the same problem (faster):
// includes

#include <bits/stdc++.h>

using namespace std;



// macros

#define pb emplace_back

#define mk make_pair

#define FOR(i, a, b) for(int i=(a);i<(b);++i)

#define rep(i, n) FOR(i, 0, n)

#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)

#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)

#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)

#define whole(x) (x).begin(),(x).end()

#define sz(x) ((int)(x).size())

#define bit(n) (1LL<<(n))

// functions

template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}

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(a > b){a = b; return 1;} return 0;}

template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}

template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}

template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}

template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}

template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}

template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}

template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types

using ll = long long int;

using P = pair<int, int>;

// constants

const int inf = 1e9;

const ll linf = 1LL << 50;

const double EPS = 1e-10;

const int mod = 1000000007;

const int dx[4] = {-1, 0, 1, 0};

const int dy[4] = {0, -1, 0, 1};

// io

struct fast_io{

  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}

} fast_io_;



vector<int> edge[100010];

int res = 0;

ll k;

int h[100010];

int par[100010];

void dfs(int i){

  for(auto e: edge[i]){

    h[e] = h[i] + 1;

    par[e] = i;

    dfs(e);

  }

}



int main(int argc, char const* argv[])

{

  int n; cin >> n >> k;

  vector<int> a(n); cin >> a; rep(i, n)a[i]--;

  if(a[0] != 0)++res;

  FOR(i, 1, n){

    edge[a[i]].pb(i);

  }

  dfs(0);

  vector<bool> vis(n, false);

  vis[0] = true;

  priority_queue<P> pq;

  FOR(i, 1, n)pq.push(mk(h[i], i));

  while(!pq.empty()){

    auto p = pq.top(); pq.pop();

    int u = p.second;

    if(vis[u])continue;

    if(p.first <= k)break;

    int r = u;

    rep(i, k - 1)r = par[r];

    ++res;

    stack<int> st; st.push(r);

    while(!st.empty()){

      auto s = st.top(); st.pop();

      vis[s] = true;

      for(auto e: edge[s]){

        if(!vis[e]){

          st.push(e);

        }

      }

    }

  }

  cout << res << endl;

  return 0;

}


// Fastest known solution for this problem: