#include <map>

#include <set>

#include <list>

#include <cmath>

#include <queue>

#include <stack>

#include <cstdio>

#include <vector>

#include <string>

#include <cctype>

#include <complex>

#include <cassert>

#include <utility>

#include <cstring>

#include <cstdlib>

#include <iostream>

#include <algorithm>

using namespace std;

typedef pair<int,int> PII;

typedef long long ll;

#define lson l,m,rt<<1

#define pi acos(-1.0)

#define rson m+1,r,rt<<11

#define All 1,N,1

#define N 100010

#define read freopen("in.txt", "r", stdin)

const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;

const int INF= 0x7ffffff;

const int mod =  ;

int dp[N],t,n;

vector<int>e[N];

int s[N];

void dfs(int root){

    int num=e[root].size();

    if(num==){

        dp[root]=;

        return ;

    }

    for(int i=;i<num;++i)

    {

        int son=e[root][i];

        dfs(son);

    }

    for(int i=;i<num;++i)

        s[i]=dp[e[root][i]];

    int len=ceil(1.0*t/*num);

    sort(s,s+num);

    for(int j=;j<len;++j)

        dp[root]+=s[j];

}

int main()

{

    while(~scanf("%d%d",&n,&t)){

        if(n==&&t==)break;

        for(int i=;i<=n;++i)

            e[i].clear();

            int p;

        for(int i=;i<=n;++i)

        {

            scanf("%d",&p);

            e[p].push_back(i);

        }

        memset(dp,,sizeof(dp));

       dfs();

       printf("%d\n",dp[]);

    }

return ;

}