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;
bool vis[1010], f[1010], b[1010];
int d[1010], a[1010], seq[1010];
void dfs(int x) {
  if (x == 0) return;
  vis[x] = true;
  if (!vis[a[x]]) dfs(a[x]);
  d[x] = d[a[x]] + 1;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), b[a[i]] = true;
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) dfs(i);
  }
  for (int i = 1; i <= n; i++) {
    int temp = i, cnt = 0;
    bool flag = false;
    while (temp) {
      seq[++cnt] = temp;
      if (temp == k) flag = true;
      temp = a[temp];
    }
    if (flag) {
      for (int j = 1; j <= cnt; j++) b[seq[j]] = true;
    }
  }
  f[d[k]] = true;
  for (int j = 1; j <= n; j++) {
    if (b[j]) continue;
    for (int i = n; i >= d[k] + 1; i--) {
      f[i] |= f[i - d[j]];
    }
  }
  for (int i = 1; i <= n; i++)
    if (f[i]) printf("%d ", i);
  return 0;
}
