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>
using namespace std;
int n, k, a[1010];
bool f0[2][1010], d[1010], *f, *g;
int main() {
  scanf("%d%d", &n, &k);
  k--;
  memset(a, -1, sizeof a);
  for (int i = 0; i < n; i++) scanf("%d", a + i), a[i]--, d[a[i]] = 1;
  f = f0[0], g = f0[1];
  f[0] = 1;
  int bf = 0;
  for (int i = 0; i < n; i++)
    if (!d[i]) {
      int s = 0;
      bool F = 0;
      for (int j = i; j != -1; j = a[j]) {
        s++;
        if (j == k) F = 1;
      }
      if (F) {
        for (int j = k; j != -1; j = a[j]) bf++;
        continue;
      }
      for (int j = 0; j < n; j++) g[j] = 0;
      for (int j = 0; j < n; j++)
        if (f[j]) g[j] = 1, g[j + s] = 1;
      swap(f, g);
    }
  for (int i = 0; i < n; i++)
    if (f[i]) printf("%d\n", i + bf);
  return 0;
}
