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 oo = 999999999;
const double PI = 3.1415931;
const double eps = 1e-9;
const int maxN = 10000;
int n, m;
bool mark[maxN];
int adj[maxN];
int deg[maxN];
int dfs(int x) {
  if (x == 0) return 0;
  if (x == m)
    return maxN;
  else
    return dfs(adj[x]) + 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    if (x) {
      adj[i] = x;
      deg[x]++;
    }
  }
  int ans = dfs(adj[m]);
  ans++;
  vector<int> q;
  for (int i = 1; i <= n; i++) {
    if (deg[i] == 0) {
      if (dfs(i) < maxN) q.push_back(dfs(i));
    }
  }
  mark[ans] = true;
  for (int i = 0; i < q.size(); i++) {
    vector<int> v;
    for (int j = 0; j < 1001; j++) {
      if (mark[j]) v.push_back(j + q[i]);
    }
    for (int j = 0; j < v.size(); j++) mark[v[j]] = true;
  }
  for (int i = 1; i <= n; i++)
    if (mark[i]) cout << i << endl;
  return 0;
}
