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>
const double Pi = acos(-1.0);
using namespace std;
int a[1010], b[1010], f[1010], v[1010];
int n, m, x, ans, temp;
int main(int argc, char** argv) {
  cin >> n >> x;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), v[a[i]] = 1;
  int y = 0, z = 0, k = 0;
  for (int i = 1; i <= n; i++) {
    if (!v[i]) {
      temp = 0;
      for (int j = i, k = 0; j; j = a[j]) {
        k++;
        if (j == x) z = k, temp = 1;
      }
      (temp) ? (y = k, z = y - z + 1) : (b[++m] = k);
    }
  }
  f[0] = 1;
  for (int i = 1; i <= m; i++)
    for (int j = n - b[i]; j >= 0; j--)
      if (f[j]) f[j + b[i]] = 1;
  for (int i = 0; i < n; i++)
    if (f[i]) printf("%d\n", i + z);
}
