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 = 1e3 + 5;
vector<int> Ans, G[MaxN];
int id[MaxN], n, pos, cnt, x, last, num[MaxN], depth[MaxN];
bool dp[MaxN];
void Dfs(int u, int now, int dep) {
  id[u] = now;
  ++num[now];
  depth[u] = dep;
  int Size = G[u].size();
  for (int i = 0; i < Size; ++i) {
    Dfs(G[u][i], now, dep + 1);
  }
}
int main() {
  scanf("%d %d", &n, &x);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &last);
    G[last].push_back(i);
  }
  int Size = G[0].size();
  for (int i = 0; i < Size; ++i) {
    Dfs(G[0][i], i + 1, 1);
  }
  pos = id[x];
  dp[0] = true;
  for (int i = 0; i < Size; ++i) {
    if (id[G[0][i]] == pos) continue;
    int p = num[id[G[0][i]]];
    for (int j = n; j >= p; j--) {
      dp[j] |= dp[j - p];
    }
  }
  int p = num[id[x]];
  for (int j = n; j >= p; --j) {
    if (dp[j - p]) Ans.push_back(j - p + depth[x]);
  }
  sort(Ans.begin(), Ans.end());
  Size = Ans.size();
  for (int i = 0; i < Size; ++i) {
    printf("%d\n", Ans[i]);
  }
  return 0;
}
