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;
int dp[1000000];
int rk[1000000], fa[1000000], cnt[1000000];
bool vis[1000000];
int n, x, y;
void init() {
  for (int i = 0; i <= n; i++) fa[i] = i, rk[i] = 0;
}
int find(int a) {
  if (fa[a] != a) {
    int t = fa[a];
    fa[a] = find(fa[a]);
    rk[a] += rk[t];
  }
  return fa[a];
}
int main() {
  scanf("%d%d", &n, &x);
  init();
  for (int i = 1; i <= n; i++) {
    scanf("%d", &y);
    if (y != 0) {
      fa[i] = y;
      rk[i] = 1;
    }
  }
  for (int i = 1; i <= n; i++) {
    int fa1 = find(i);
    cnt[fa1]++;
  }
  int fax = find(x);
  dp[0] = 1;
  for (int i = 1; i <= n; i++) {
    if (i != fax && cnt[i]) {
      for (int j = n + 1; j >= cnt[i]; j--)
        if (dp[j - cnt[i]]) dp[j] = 1;
    }
  }
  for (int i = 0; i <= n; i++)
    if (dp[i]) {
      printf("%d\n", i + rk[x] + 1);
    }
}
