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 n, x;
int a[1005];
bool tail[1005];
int main() {
  while (scanf("%d%d", &n, &x) != EOF) {
    --x;
    for (int i = 0; i < (n); ++i) scanf("%d", &a[i]), --a[i];
    for (int i = 0; i < (n); ++i) tail[i] = true;
    for (int i = 0; i < (n); ++i)
      if (a[i] != -1) tail[a[i]] = false;
    vector<int> cnt;
    for (int i = 0; i < (n); ++i)
      if (tail[i]) {
        int c = 0, k;
        for (k = i; k != -1; k = a[k]) {
          if (k == x) break;
          ++c;
        }
        if (k == -1) cnt.push_back(c);
      }
    int base = 0;
    for (int k = x; k != -1; k = a[k]) ++base;
    set<int> dp1, dp2;
    dp1.insert(0);
    for (int i = 0; i < (((int)cnt.size())); ++i) {
      dp2 = dp1;
      for (set<int>::iterator it = dp1.begin(); it != dp1.end(); ++it) {
        dp2.insert(*it + cnt[i]);
      }
      dp1 = dp2;
    }
    for (set<int>::iterator it = dp1.begin(); it != dp1.end(); ++it) {
      printf("%d\n", base + *it);
    }
  }
  return 0;
}
