20 20
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
 10 4
0 1 4 2 7 0 10 0 5 8
 10 7
10 8 6 5 0 0 0 4 3 9
 10 1
8 7 0 2 0 10 0 0 3 5
 10 7
7 9 2 10 0 0 0 3 5 1
 10 2
10 0 9 0 0 4 2 6 8 0
 10 2
0 7 0 10 8 0 4 2 3 0

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
 3
4
8
9
 1
5
6
10
 2
4
5
7
8
10
 1
2
6
7
 1
2
3
4
6
7
8
9
 4
5
6
7
8

#include <bits/stdc++.h>
int n, k, i, j, p, z, a[1010], b[1010];
bool q, u[2010];
int main() {
  scanf("%d%d", &n, &k);
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    b[a[i]] = i;
  }
  u[0] = true;
  for (i = 1; i <= n; i++)
    if (a[i] == 0) {
      q = false;
      for (p = i, j = 1; p != 0; j++, p = b[p])
        if (p == k) {
          q = true;
          z = j;
        }
      if (!q)
        for (int i = n; i >= 0; i--)
          if (u[i]) u[i + j - 1] = true;
    }
  for (i = 0; i <= n; i++)
    if (u[i]) printf("%d\n", i + z);
  return 0;
}
