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;
template <typename T>
inline void read(T &x) {
  x = 0;
  char c = getchar(), f = 0;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') f = 1;
  for (; c >= '0' && c <= '9'; c = getchar())
    x = (x << 1) + (x << 3) + (c ^ 48);
  if (f) x = -x;
}
int vl, wh, n, nx[1005], a[1005], m;
char st[1005], dp[1005];
int main() {
  read(n), read(wh);
  for (int i = 1, x; i <= n; i++) read(x), x ? nx[x] = i, st[i] = 1 : 0;
  for (int i = 1, c, x; i <= n; i++)
    if (!st[i]) {
      char tag = (c = 0) * (x = i);
      while (x) c++, (x == wh ? tag = 1, vl = c : 0), x = nx[x];
      if (!tag) a[++m] = c;
    }
  dp[0] = 1;
  for (int i = 1; i <= m; i++)
    for (int j = n; j >= a[i]; j--) dp[j] |= dp[j - a[i]];
  for (int i = 0; i <= n; i++)
    if (dp[i]) printf("%d\n", i + vl);
  return 0;
}
