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;
#pragma comment(linker, "/STACK:100000000")
int mas[1111];
int obr[1111];
vector<int> lines;
int main() {
  int n, x;
  scanf("%d %d", &n, &x);
  for (int i = 1; i <= n; i++) scanf("%d", &mas[i]), obr[mas[i]] = i;
  int num = -1;
  int bobrlen = 0;
  int g = 0;
  for (int i = 1; i <= n; i++) {
    if (mas[i] == 0) {
      int len = 1;
      int v = i;
      int d = 0;
      if (v == x) num = (int)(lines).size(), g = d;
      while (obr[v] != 0) {
        d++;
        v = obr[v];
        if (v == x) num = (int)(lines).size(), g = d;
        len++;
      }
      lines.push_back(len);
    }
  }
  bobrlen = lines[num];
  swap(lines[num], lines[(int)(lines).size() - 1]);
  lines.pop_back();
  sort(lines.begin(), lines.end());
  bool can[11111];
  for (int i = 0; i < 11111; i++) can[i] = false;
  can[0] = true;
  for (int i = (int)(lines).size() - 1; i >= 0; i--) {
    for (int j = 1110; j >= 0; j--) {
      if (can[j]) {
        can[j + lines[i]] = true;
      }
    }
  }
  for (int i = 0; i < 11111; i++) {
    if (can[i]) {
      printf("%d\n", i + g + 1);
    }
  }
  return 0;
}
