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 s[5555], b[5555];
bool mark[5555], moze[5555];
int main() {
  int n, x, i, j, t, q, br, of, bb;
  scanf("%d%d", &n, &x);
  for (i = 0; i <= n; i++) mark[i] = false;
  for (i = 1; i <= n; i++) {
    scanf("%d", &s[i]);
    mark[s[i]] = true;
  }
  br = 0;
  of = 0;
  q = -1;
  for (i = 1; i <= n; i++) {
    if (!mark[i]) {
      t = i;
      bb = 0;
      b[br] = 0;
      while (t != 0) {
        b[br]++;
        if (bb) of++;
        if (t == x) {
          of++;
          bb = 1;
        }
        t = s[t];
      }
      if (bb) q = br;
      br++;
    }
  }
  for (i = 0; i <= 1555; i++) moze[i] = false;
  moze[of] = true;
  for (i = 0; i < br; i++)
    if (i != q) {
      for (j = 1234; j > 0; j--)
        if (moze[j - b[i]]) moze[j] = true;
    }
  for (i = 1; i <= 1234; i++)
    if (moze[i]) printf("%d\n", i);
  return 0;
}
