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 was[1111], pr[1111], l[1111], ln = 0, dep[1111], tail[1111], f[1111];
int n, x, add = 0;
int dfs(int x) {
  if (x == 0) return 0;
  was[x] = true;
  return dep[x] = dfs(pr[x]) + 1;
}
int main() {
  scanf("%d%d", &n, &x);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &pr[i]);
    tail[pr[i]] = true;
  }
  for (int i = 1; i <= n; ++i)
    if (!tail[i]) {
      bool clev = (dep[x] == 0);
      dfs(i);
      if (clev && dep[x] != 0) {
        add = dep[x];
      } else {
        l[ln++] = dep[i];
      }
    }
  f[0] = 1;
  for (int i = 0; i < ln; ++i) {
    for (int j = n; j >= l[i]; j--) f[j] |= f[j - l[i]];
  }
  for (int i = 0; i <= n; ++i) {
    if (f[i]) {
      cout << i + add << endl;
    }
  }
  return 0;
}
