//树形DP,新技能get!核心代码是书上的。。
#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=1e5 + 5;
vector<int> sons[maxn];
int n, T;
int dp(int u)
{
if(sons[u].empty()) return 1;
int k = sons[u].size();
vector<int> d;
for(int i=0;i<k;++i)
d.push_back(dp(sons[u][i]));
sort(d.begin(),d.end());
int c=(k*T-1)/100+1;
int ans=0;
for(int i=0;i<c;++i) ans+=d[i];
return ans;
}
int main()
{
while(scanf("%d%d", &n, &T) == 2)
{
if(n==0 && T==0) return 0;
for(int i=0;i<=n;++i) sons[i].clear();
for(int i=1;i<=n;++i)
{
int u;
scanf("%d",&u);
sons[u].push_back(i);
}
printf("%d\n",dp(0));
}
return 0;
}