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 maxn = 1003;
int to[maxn], from[maxn];
int a[maxn];
struct node {
  int h, size;
} p[maxn];
int f;
int tot;
int dp[maxn];
int main() {
  int i, j;
  int n, x;
  bool flag = 0;
  scanf("%d%d", &n, &x);
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i]) {
      flag = 1;
      from[i] = a[i];
      to[a[i]] = i;
    }
  }
  if (!flag) {
    for (i = 1; i <= n; i++) printf("%d\n", i);
    return 0;
  }
  int cnt = 0;
  for (i = 1; i <= n; i++) {
    if (!from[i]) {
      p[++tot].h = i;
      int c = 1;
      j = i;
      if (j == x) {
        cnt = 1;
        f = tot;
      }
      bool g = 0;
      while (to[j]) {
        j = to[j];
        if (j == x) {
          g = 1;
        }
        c++;
      }
      p[tot].size = c;
      if (g) {
        f = tot;
        j = i;
        c = 1;
        while (to[j]) {
          j = to[j];
          if (j == x) cnt = c + 1;
          c++;
        }
      }
    }
  }
  memset(dp, 0, sizeof(dp));
  dp[0] = 1;
  for (i = 1; i <= tot; i++)
    if (i != f) {
      int size = p[i].size;
      for (j = n; j >= size; j--)
        if (dp[j - size]) dp[j] = 1;
    }
  vector<int> ans;
  for (i = 0; i <= n; i++)
    if (dp[i]) ans.push_back(i + cnt);
  sort(ans.begin(), ans.end());
  for (i = 0; i < ans.size(); i++) printf("%d\n", ans[i]);
  return 0;
}
