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 a[1010], g[1010], d[1010];
bool f[1010];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) {
    for (g[i] = i; a[g[i]]; g[i] = a[g[i]])
      ;
  }
  for (int i = 1; i <= n; i++) d[g[i]]++;
  d[g[k]] = 0;
  int add = 0;
  for (int i = k; i; i = a[i]) add++;
  f[0] = true;
  for (int i = 1; i <= n; i++) {
    if (!d[i]) continue;
    for (int j = n; j >= d[i]; j--) {
      f[j] |= f[j - d[i]];
    }
  }
  for (int i = 0; i <= n; i++)
    if (f[i]) printf("%d\n", i + add);
  return 0;
}
