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 = 2050;
int n, k;
int pre[N];
int ith[N];
int cnt[N];
int back[N];
void dfs(int now) {
  if (ith[now]) return;
  if (now == k) back[now] = -1;
  if (pre[now]) {
    dfs(pre[now]);
    if (now == k) back[now] = -1;
    if (back[pre[now]] == -1)
      back[now] = -1;
    else
      back[pre[now]] = now;
    ith[now] = ith[pre[now]] + 1;
  } else {
    ith[now] = 1;
  }
}
int main(void) {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> pre[i];
  for (int i = 1; i <= n; ++i) dfs(i);
  vector<int> vec;
  for (int i = 1; i <= n; ++i)
    if (back[i] == 0) vec.push_back(ith[i]);
  cnt[0] = 1;
  for (auto &m : vec) {
    for (int i = n; i >= 0; --i) {
      if (cnt[i]) cnt[i + m] = 1;
    }
  }
  vector<int> ans;
  for (int i = 0; i <= n; ++i)
    if (cnt[i]) ans.push_back(i);
  for (auto &m : ans) cout << m + ith[k] << endl;
  return 0;
}
