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;
const int N = 1005;
int p[N], to[N], n, x, cnt, pos, save;
bool ok, may[N];
vector<int> dif;
void dfs(int v) {
  cnt++;
  pos++;
  if (v == x) {
    ok = 1;
    save = pos;
  }
  if (to[v]) dfs(to[v]);
}
int main() {
  cin >> n >> x;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    if (p[i]) to[p[i]] = i;
  }
  for (int i = 1; i <= n; i++) {
    if (!p[i]) {
      cnt = 0;
      pos = 0;
      ok = 0;
      dfs(i);
      if (!ok) dif.push_back(cnt);
    }
  }
  may[0] = 1;
  for (int i = 0; i < (int)(dif).size(); i++) {
    for (int j = N - 1; j >= 0; j--)
      if (may[j]) {
        if (j + dif[i] < N) may[j + dif[i]] = 1;
      }
  }
  for (int j = 0; j + save < N; j++) {
    if (may[j]) cout << j + save << endl;
  }
  return 0;
}
