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 = 1005;
int n, x;
int a[MAXN];
int father[MAXN];
int len[MAXN];
bool visit[MAXN];
void init() {
  for (int i = 1; i <= n; ++i) {
    father[i] = i;
    len[i] = 1;
  }
}
int find(int x) {
  if (x == father[x]) {
    return x;
  }
  return father[x] = find(father[x]);
}
void combine(int x, int y) {
  x = find(x);
  y = find(y);
  father[x] = y;
  len[y] += len[x];
  len[x] = 0;
}
int main() {
  while (~scanf("%d%d", &n, &x)) {
    init();
    for (int i = 1; i <= n; ++i) {
      scanf("%d", &a[i]);
      if (a[i]) {
        if (find(i) != find(a[i])) {
          combine(i, a[i]);
        }
      }
    }
    int shift = 1;
    int temp = x;
    while (a[temp]) {
      ++shift;
      temp = a[temp];
    }
    memset(visit, false, sizeof(visit));
    visit[0] = true;
    for (int i = 1; i <= n; ++i) {
      if (len[i]) {
        if (find(x) == find(i)) {
          continue;
        }
        for (int j = n; j >= len[i]; --j) {
          if (visit[j - len[i]]) {
            visit[j] = true;
          }
        }
      }
    }
    for (int i = 0; i < n; ++i) {
      if (visit[i]) {
        printf("%d\n", i + shift);
      }
    }
  }
  return 0;
}
