output_description: Print the minimum number of the Teleporters whose destinations need to be
  changed in order to satisfy King Snuke's desire.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N K
      a_1 a_2 ... a_N
attempt: N, K = map(int, input().split())
  a = list(map(int, input().split()))
  
  
  # 首都をノードとする根付き木を構成する
  vec = [[] for i in range(N)]
  
  for i in range(N):
      # 首都を根とした木を構成するのでノードの向きは a[i] - 1 => i
      vec[a[i] - 1].append(i)
  
  # ループをなくす
  if a[0] != 1:
      ans = 1
      a[0] = 1
  else:
      ans = 0
  vec[0].remove(0)
  
  
  # あるノードのparはこのノードを指しているノードである
  # depth = K - 1のとき
  # その次のノードがparを指すように変更して探索を続ける
  # 各ノードは一度しか探索しない
  def dfs(v, depth, par):
      count = 0
      if depth == K:
          depth, par = 0, 0
          count += len(vec[v])
          for s in vec[v]:
              count += dfs(s, depth, par)
      else:
          for s in vec[v]:
              count += dfs(s, depth + 1, v)
      return count
  
  
  ans += dfs(0, 0, 0)
  print(ans)
  
problem_description: Statement
  
  There are N towns in Snuke Kingdom, conveniently numbered 1 through N. Town 1
  is the capital.
  
  Each town in the kingdom has a _Teleporter_ , a facility that instantly
  transports a person to another place. The destination of the Teleporter of
  town i is town a_i (1≤a_i≤N). It is guaranteed that **one can get to the
  capital from any town by using the Teleporters some number of times**.
  
  King Snuke loves the integer K. The selfish king wants to change the
  destination of the Teleporters so that the following holds:
  
    * Starting from any town, one will be at the capital after using the Teleporters exactly K times in total.
  
  Find the minimum number of the Teleporters whose destinations need to be
  changed in order to satisfy the king's desire.
samples: [{"input": "3 1\n    2 3 1", "output": "2\n    \n\nChange the destinations of the Teleporters to a = (1,1,1).\n\n* * *"}, {"input": "4 2\n    1 1 2 2", "output": "0\n    \n\nThere is no need to change the destinations of the Teleporters, since the\nking's desire is already satisfied.\n\n* * *"}, {"input": "8 2\n    4 1 2 3 1 2 3 4", "output": "3\n    \n\nFor example, change the destinations of the Teleporters to a =\n(1,1,2,1,1,2,2,4)."}]