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> ad[2009];
int vis[2009];
int cnt;
vector<int> cp;
int p, X;
void dfs(int u) {
  vis[u] = 1;
  cnt++;
  if (u == X) p = 1;
  for (auto x : ad[u]) {
    if (vis[x]) continue;
    dfs(x);
  }
}
int dp[20009];
int main() {
  int i, j, k, l, m, n, x;
  cin >> n >> x;
  X = x;
  for (i = 1; i <= n; i++) {
    cin >> l;
    if (l == 0) continue;
    ad[i].push_back(l);
    ad[l].push_back(i);
  }
  p = 0;
  int ex;
  for (i = 1; i <= n; i++) {
    if (vis[i] == 0) {
      cnt = 0;
      dfs(i);
      if (!p)
        cp.push_back(cnt);
      else
        ex = cnt, p = 0;
    }
  }
  for (i = 1; i <= n; i++) dp[i] = 1e9;
  dp[0] = 0;
  for (j = 0; j < cp.size(); j++) {
    for (i = n - ex; i >= 1; i--) {
      if (cp[j] <= i) dp[i] = min(dp[i], 1 + dp[i - cp[j]]);
    }
  }
  cout << ex << '\n';
  for (i = 1; i <= n - ex; i++) {
    if (dp[i] != 1e9) {
      cout << i + ex << '\n';
    }
  }
}
