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 double Pi = acos(-1.0);
const int INF = 1 << 29;
const int MAXN = 1005;
int n, x;
int nxt[MAXN];
int prv[MAXN];
int bPos = -1;
int T[MAXN];
vector<int> L;
int traverse(int ind, int depth) {
  if (ind == x) {
    bPos = depth;
  }
  if (prv[ind] == -1) {
    return 1;
  }
  return traverse(prv[ind], depth + 1) + 1;
}
int main(int argc, char** argv) {
  scanf("%d%d", &n, &x);
  x--;
  for (int i = 0; i < n; i++) {
    prv[i] = -1;
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &nxt[i]);
    nxt[i]--;
    if (nxt[i] != -1) {
      prv[nxt[i]] = i;
    }
  }
  for (int i = 0; i < n; i++) {
    if (nxt[i] == -1) {
      int init = bPos;
      int len = traverse(i, 1);
      if (bPos == init) L.push_back(len);
    }
  }
  T[0] = 1;
  for (int i = 0; i < (int)L.size(); i++) {
    for (int j = n - 1; j >= 0; j--) {
      if (T[j] == 1 && j + L[i] < n) {
        T[j + L[i]] = 1;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (T[i] == 1) {
      printf("%d\n", i + bPos);
    }
  }
  return 0;
}
