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 a[1100], ne[1100];
vector<int> ve[1100];
bool look[1100];
int main() {
  int n, x;
  cin >> n >> x;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    ne[a[i]] = i;
  }
  int counter = 0;
  int ans = 0, anspos = 0;
  for (int i = 1; i <= n; i++) {
    if (!a[i]) {
      int temp = i;
      while (temp) {
        ve[counter].push_back(temp);
        if (temp == x) {
          ans = counter;
          anspos = ve[counter].size();
        }
        temp = ne[temp];
      }
      counter++;
    }
  }
  look[0] = 1;
  for (int i = 0; i < counter; i++) {
    if (i != ans)
      for (int j = 1100 - 1; j >= 0; j--) {
        if (look[j]) {
          look[j + ve[i].size()] = 1;
        }
      }
  }
  for (int i = 0; i < 1100; i++) {
    if (look[i]) cout << i + anspos << endl;
  }
}
