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;
long long n, m;
int a[maxn];
int rankm;
stack<int> s[maxn];
int to[maxn];
int tot = 1;
bool vis[maxn];
int cnt = 0;
int dp[10005];
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] == 0) {
      s[tot].push(i);
      to[i] = tot++;
      cnt++;
      if (m == i) {
        rankm = s[to[i]].size();
      }
    }
  }
  while (cnt < n) {
    for (int i = 1; i <= n; i++) {
      if (to[a[i]] && !to[i]) {
        s[to[a[i]]].push(i);
        to[i] = to[a[i]];
        cnt++;
        if (m == i) {
          rankm = s[to[i]].size();
        }
      }
    }
  }
  int sum = 0;
  for (int i = 1; i < tot; i++) {
    if (i == to[m]) continue;
    sum += s[i].size();
  }
  dp[0] = 1;
  for (int i = 1; i < tot; i++) {
    if (i == to[m]) continue;
    int len = s[i].size();
    for (int j = sum; j >= len; j--) {
      if (dp[j - len]) {
        dp[j] = 1;
      }
    }
  }
  for (int i = 0; i <= sum; i++) {
    if (dp[i]) {
      printf("%d\n", i + rankm);
    }
  }
  return 0;
}
