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 dp[1100][1100];
int a[1100], cnt;
void gao(int n) {
  int i, j;
  dp[0][0] = 1;
  for (i = 0; i < n; i++) {
    for (j = 0; j <= 1000; j++)
      if (dp[i][j]) {
        if (j + a[i + 1] <= 1000) dp[i + 1][j + a[i + 1]] = 1;
        dp[i + 1][j] = 1;
      }
  }
}
int fa[1100];
int you[1100];
void ca(int n, int x) {
  int i = 1, is = 0;
  if (n == x) is = 1;
  while (fa[n]) {
    i++, n = fa[n];
    if (n == x) is = 1;
  }
  if (!is) a[++cnt] = i;
}
int main() {
  int n, x, i, j, k;
  scanf("%d", &n);
  scanf("%d", &x);
  for (i = 1; i <= n; i++) {
    scanf("%d", &j);
    you[j] = 1;
    fa[i] = j;
  }
  for (i = 1; i <= n; i++)
    if (!you[i]) ca(i, x);
  gao(cnt);
  int ans = 1;
  while (fa[x]) ans++, x = fa[x];
  for (i = 0; i <= 1000; i++)
    if (dp[cnt][i]) printf("%d\n", ans + i);
}
