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 = 10000000;
int g[1005];
bool vis[1005];
vector<int> v, vv;
int cou;
int x, n;
bool gotit;
bool res[1005];
void dfs(int u) {
  cou++;
  if (x == u) {
    gotit = 1;
    return;
  }
  if (g[u] == -1) return;
  dfs(g[u]);
}
int main() {
  cin >> n >> x;
  x--;
  memset((g), (-1), sizeof(g));
  int a;
  for (int i = 0; i < (n); i++) {
    scanf("%d", &a);
    if (!a)
      v.push_back(i);
    else {
      a--;
      g[a] = i;
    }
  }
  int mysize;
  for (int i = 0; i < (((int)(v).size())); i++) {
    cou = 0;
    gotit = 0;
    dfs(v[i]);
    if (gotit)
      mysize = cou;
    else
      vv.push_back(cou);
  }
  res[0] = 1;
  for (int i = 0; i < (((int)(vv).size())); i++)
    for (int j = n; j >= 0; j--) {
      int t = vv[i];
      if (j + t > n) continue;
      res[j + t] |= res[j];
    }
  for (int i = 0; i < (n + 1); i++)
    if (res[i]) printf("%d\n", i + mysize);
  return 0;
}
