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 = 2e3 + 5;
int arr[N], cnt, n, k;
bool vis[N], found;
int dp[N];
vector<int> tree[N], v;
void dfs(int u) {
  if (u == k) found = 1;
  cnt++;
  vis[u] = 1;
  for (int i = 0; i < tree[u].size(); i++) {
    int to = tree[u][i];
    dfs(to);
  }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
    if (arr[i] != 0) tree[arr[i]].push_back(i);
  }
  int infront = 0;
  for (int i = 1; i <= n; i++) {
    if (arr[i] == 0) {
      found = 0;
      cnt = 0;
      dfs(i);
      if (!found)
        v.push_back(cnt);
      else {
        int cur = k;
        while (arr[cur] != 0) {
          infront++;
          cur = arr[cur];
        }
        infront++;
      }
    }
  }
  sort(v.begin(), v.end());
  dp[infront] = 1;
  for (int i = 0; i < v.size(); i++) {
    for (int j = 1000; j >= 1; j--)
      if (dp[j]) dp[j + v[i]] = 1;
  }
  for (int i = 1; i <= n; i++)
    if (dp[i]) cout << i << endl;
  return 0;
}
