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 main() {
  int n, x, j;
  int temp, ct;
  int base;
  long long int val;
  bool smart;
  cin >> n >> x;
  vector<int> next(n + 1, 0);
  vector<int> inDeg(n + 1, 0);
  for (int i = 1; i <= n; i++) {
    cin >> temp;
    if (temp != 0) {
      next[i] = temp;
      inDeg[temp]++;
    }
  }
  vector<int> sums;
  for (int i = 1; i <= n; i++)
    if (inDeg[i] == 0) {
      j = i;
      ct = 1;
      smart = false;
      if (j == x) smart = true;
      while (next[j] != 0) {
        if (j == x) {
          smart = true;
          break;
        }
        j = next[j];
        ct++;
      }
      if (!smart) sums.push_back(ct);
    }
  j = x;
  base = 1;
  while (next[j] != 0) {
    j = next[j];
    base++;
  }
  set<long long int> pos;
  pos.insert(0);
  stack<long long int> toAdd;
  for (int i = 0; i < sums.size(); i++) {
    val = (long long int)sums[i];
    for (auto it = pos.begin(); it != pos.end(); it++) toAdd.push(*it + val);
    pos.insert(val);
    while (!toAdd.empty()) {
      pos.insert(toAdd.top());
      toAdd.pop();
    }
  }
  for (auto it = pos.begin(); it != pos.end(); it++) cout << *it + base << endl;
}
