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;
const int N = 2000;
int c[N], cnt, a[N], b[N], n, pos, head[N], blg, ord;
bool f[N], ans[N];
void solve(const int k) {
  memset(f, 0, sizeof(f));
  f[0] = true;
  for (int i = 0; i < cnt; i++)
    if (i != k)
      for (int j = n - c[i]; j >= 0; j--)
        if (f[j]) f[j + c[i]] = true;
  for (int i = 0; i <= n; i++)
    if (f[i]) ans[i + ord] = true;
}
void init() {
  scanf("%d%d", &n, &pos);
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    b[a[i]] = i;
  }
  for (int i = 1; i <= n; i++)
    if (b[i] == 0) {
      int j;
      c[cnt] = 1;
      for (j = i; a[j]; j = a[j]) {
        if (j == pos) {
          ord = c[cnt];
          blg = cnt;
        }
        c[cnt]++;
      }
      if (j == pos) {
        ord = c[cnt];
        blg = cnt;
      }
      head[cnt] = j;
      cnt++;
    }
}
void output() {
  for (int i = 1; i <= n; i++)
    if (ans[i]) printf("%d\n", i);
}
int main() {
  init();
  solve(blg);
  output();
}
