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;
long father[1010], tot[1010], s[1010];
bool f[1010];
long n, x, t, tots;
long find(const long h) {
  if (father[h] == h)
    return h;
  else
    return find(father[h]);
}
int main() {
  int i;
  cin >> n >> x;
  for (i = 1; i <= n; i++) {
    father[i] = i;
    tot[i] = 1;
  }
  for (i = 1; i <= n; i++) {
    cin >> t;
    if (t != 0) {
      father[i] = t;
      tot[find(i)] += tot[i];
    }
  }
  tot[find(x)] = 0;
  for (i = 1; i <= n; i++)
    if (father[i] == i) s[++tots] = tot[i];
  i = x;
  t = 1;
  while (father[i] != i) {
    i = father[i];
    t++;
  }
  memset(f, 0, sizeof(f));
  f[t] = true;
  for (i = 1; i <= tots; i++) {
    for (long j = n; j >= s[i]; j--) {
      f[j] = f[j] || f[j - s[i]];
    }
  }
  for (int i = 1; i <= n; i++)
    if (f[i]) cout << i << endl;
  return 0;
}
