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 maxn = 1005;
int a[maxn];
int cnt[maxn];
vector<int> p;
int n, x;
bool bb;
int dfs(int v) {
  if (v == x) bb = true;
  if (v == 0) return 0;
  return 1 + dfs(a[v]);
}
char dp[maxn + 1][maxn + 1];
int main(int argc, char **argv) {
  cin >> n >> x;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    cnt[a[i]] = 1;
  }
  int dd = dfs(x);
  for (int i = 1; i <= n; i++)
    if (i != x && cnt[i] == 0) {
      bb = false;
      int d = dfs(i);
      if (!bb) p.push_back(d);
    }
  dp[0][0] = 1;
  for (int i = 1; i <= p.size(); i++) {
    for (int w = 0; w <= maxn; w++) {
      dp[w][i] = dp[w][i - 1];
      if (w - p[i - 1] >= 0) {
        dp[w][i] |= dp[w - p[i - 1]][i - 1];
      }
    }
  }
  set<int> s;
  s.insert(0);
  for (int i = 1; i <= maxn; i++)
    if (dp[i][p.size()]) s.insert(i);
  for (set<int>::iterator it = s.begin(); it != s.end(); it++) {
    cout << *it + dd << endl;
  }
  return 0;
}
