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;
namespace Sol {
const int N = 1010;
int n, x;
int pre[N];
bool vst[N];
bool in[N];
int belong;
int posx;
bool f[N];
struct Bg {
  int x;
} bg[N];
int tot = 0;
int pos = 0;
void dfs(int u) {
  if (u == 0) return;
  dfs(pre[u]);
  pos++;
  if (u == x) {
    belong = tot;
    posx = pos;
  }
  bg[tot].x++;
}
void sol() {
  memset(in, 0, sizeof(in));
  memset(f, 0, sizeof(f));
  scanf("%d", &n);
  scanf("%d", &x);
  for (int i = 1; i < n + 1; ++i) {
    scanf("%d", &pre[i]);
    in[pre[i]] = 1;
  }
  for (int i = 1; i < n + 1; ++i) {
    if (!in[i]) {
      pos = 0;
      dfs(i);
      tot++;
    }
  }
  f[0] = 1;
  for (int i = 0; i < tot; ++i) {
    if (i == belong) continue;
    for (int v = n; v >= bg[i].x; --v) {
      if (f[v - bg[i].x]) f[v] = 1;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (f[i]) {
      printf("%d\n", posx + i);
    }
  }
}
}  // namespace Sol
int main() {
  Sol::sol();
  return 0;
}
