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;
vector<int> v[1111];
int b[1111], a[1111], kol;
bool f[1111], used[1111];
void dfs(int j) {
  used[j] = true;
  kol++;
  for (int i = 0; i < v[j].size(); i++)
    if (!used[v[j][i]]) dfs(v[j][i]);
}
int main() {
  int n, x;
  cin >> n >> x;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] != 0) {
      v[i].push_back(a[i]);
      v[a[i]].push_back(i);
    }
  }
  int ans, cont = 0;
  for (ans = 1; a[x] != 0; x = a[x], ans++)
    ;
  for (int i = 1; i <= n; i++)
    if (!used[i]) {
      kol = 0;
      dfs(i);
      if (!used[x])
        b[cont++] = kol;
      else
        used[x] = false;
    }
  f[0] = true;
  for (int i = 0; i < cont; i++)
    for (int j = n; j > 0; j--)
      if (f[j - b[i]]) f[j] = true;
  for (int i = 0; i <= n; i++)
    if (f[i]) cout << i + ans << endl;
  cin >> n;
  return 0;
}
