#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <math.h>
#include <map>
#include <set>
#include <queue>

using namespace std;

typedef long long ll;
vector <vector <int>> g;
vector <vector <int>> rg;
vector <int> used;
vector <int> ls;
vector <int> p;

int dfs(int v, int len) {
    int maxi = len;
    for (int u : g[v]) {
        maxi = max(dfs(u, len + 1), maxi);
    }
    p[v] = maxi;
    return maxi;
}

void dfs2(int v, int len) {
    if (g[v].size() == 0) {
        ls.push_back(len);
    }
    int maxi = 0;
    int res = 0;
    for (int u : g[v]) {
        if (p[u] > maxi) {
            maxi = p[u];
            res = u;
        }
    }
    for (int u : g[v]) {
        if (u != res)
            dfs2(u, 1);
        else
            dfs2(u, len + 1);
    }
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, kk;
    cin >> n >> kk;
    int k = kk;
    g.resize(n);
    rg.resize(n);
    used.resize(n);
    p.resize(n);

    for (int i = 1; i < n; i++) {
        int v;
        cin >> v;
        v--;
        g[v].push_back(i);
        rg[i].push_back(v);
    }

    dfs(0, 1);
    dfs2(0, 1);


    sort(ls.begin(), ls.end());
    reverse(ls.begin(), ls.end());

    ll ans = 0;
    for (int i = 0; i < min(k, (int)ls.size()); i++)
        ans += ls[i];
    cout << ans;
}