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 n, first, a[1111];
int b[1111], ub = -1, pos;
vector<int> c[1111];
vector<int> d;
int can[1111];
void go(int p, int v) {
  if (v == -1) return;
  if (v == first) ub = p;
  c[p].push_back(v);
  go(p, a[v]);
}
int main() {
  scanf("%d%d", &n, &first);
  --first;
  for (int i = 0; i < n; ++i) b[i] = -1;
  for (int i = 0; i < n; ++i) {
    scanf("%d", a + i);
    a[i]--;
    b[a[i]] = i;
  }
  for (int i = 0; i < n; ++i) {
    c[i].clear();
    if (b[i] == -1) {
      go(i, i);
    }
  }
  assert(ub >= 0);
  d.clear();
  for (int i = 0; i < c[ub].size(); ++i) {
    if (c[ub][i] == first) pos = i;
  }
  for (int i = 0; i < n; ++i) {
    if (i == ub) continue;
    if (c[i].size() != 0) d.push_back(c[i].size());
  }
  sort(d.begin(), d.end());
  for (int i = 0; i < n; ++i) can[i] = 0;
  can[0] = 1;
  for (int i = 0; i < d.size(); ++i) {
    for (int j = n - 1; j >= 0; --j) {
      if ((j + d[i] < n) && (can[j] == 1)) can[j + d[i]] = 1;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (can[i]) cout << i + pos + 1 << endl;
  }
  return 0;
}
