#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;

int seen[101010];
int N, K;
int up[101010];
vi down[101010];
int use[101010];

int d[101010];

bool dfs(int idx = 0, int depth = 0) {
    d[idx] = depth;
    for (auto nxt : down[idx]) {
        dfs(nxt, depth + 1);
    }
}

void solve() {
    dfs();
    auto c = [](pi a, pi b) { return a.first < b.first; };
    priority_queue<pair<int, int>, vp, decltype(c)> que(c);
    FOR(N) {
        if (down[i].size() == 0)
            que.push({d[i], i});
    }
    use[0] = 1;
    seen[0] = 1;
    int asn = 0;
    if (up[0] != 0) {
        ans++;
        up[0] = 0;
    }
    while (!que.empty()) {
        int idx = que.top().second;
        itn depth = que.top().first;
        que.pop();
        //cerr << idx + 1 << endl;

        int k = K;
        while (--k) {
            if (seen[idx]) {
                break;
            }
            seen[idx] = 1;
            idx = up[idx];
        }
        if (up[idx] == 0)
            continue;
        if (!seen[idx]) {
            seen[idx] = 1;
            if (!use[idx]) {
                //cerr << "use : " << idx + 1 << endl;
                use[idx] = 1;
                ans++;
                itn nxt = up[idx];
                que.push({d[nxt], nxt});
            }
        }
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N >> K;
    FOR(N) {
        cin >> up[i];
        up[i]--;
        if (i != 0) {
            down[up[i]].eb(i);
        }
    }

    solve();
    return 0;
}


Measured memory_bytes: 12032