#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>
#include <set>
#include <cstring>
#include <queue>
#define MX 100002
using namespace std;
vector<int> adj[MX];
int N,D;
int dep[MX];
set<pair<int,int>> nodes;
set<pair<int,int>>::iterator ptr[MX];
bool removed[MX];
int parent[MX];
bool visited[MX];
bool leaf[MX];
void dfs(int u, int par, int depth) {
    parent[u] = par;
    dep[u] = depth;
    if (adj[u].size() == 1) leaf[u] = true;
    auto it = nodes.insert({depth,u}).first;
    ptr[u] = it;
    for (auto v: adj[u]) {
        if (v != par) {
            dfs(v, u, depth+1);
        }
    }
}
bool dfs_maxD(int u, int par, int depth, bool mark) {
    if (depth >= D ) {
        return leaf[u];
    }
    bool isleaf = true;
    for (auto v: adj[u]) {
        if (v != par && !visited[v]) {
            isleaf = isleaf && dfs_maxD(v, u, depth+1, mark);
        }
    }
    if (!removed[u]) {
        nodes.erase(ptr[u]);
        removed[u] = true;
    }
    if (mark || leaf[u]) //mark the subtree as visited
        visited[u] = true;
    return isleaf;
}


int main() {
    cin >> N >> D;
    for (int i=1; i<N; i++) {
        int a;
        cin >> a;
        adj[i].push_back(a);
        adj[a].push_back(i);
    }
    dfs(0,-1, 0);
    int ans = 0;
    while (!nodes.empty()) {
        auto &[d, node]  = *nodes.rbegin();
        int cur = node;
        for (int i=1; i<=(D-1)/2; i++) {
            if (parent[cur] != -1)
                cur = parent[cur];
            else
                break;
        }
        dfs_maxD(cur, parent[cur], 0, true); //take care of subtree
        dfs_maxD(cur, -1, (D-1)/2, false);
        ans++;
    }
    cout << ans;
    return 0;
}