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


import java.util.Arrays;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Alik
 */
public class B {
    static int n, x, a[], p[], q[];
    static boolean w[];
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n = in.nextInt(); x = in.nextInt(); a = new int [n + 1]; p = new int [n + 1]; q = new int [n + 1];
        w = new boolean [2000]; int ans = 0;
        for (int i = 1; i <= n; i++) {
            a[i] = in.nextInt();
            if (a[i] == 0) {
                p[i] = 1;
                q[i] = 1;
                if (i == x) { q[i] = 2; ans = 1; }
            }
        }
        for (int i = 0; i < n; i++)
            for (int j = 1; j <= n; j++) {
                if (a[j] != 0 && p[a[j]] != 0 && p[j] == 0) {
                    p[j] = p[a[j]] + 1;
                    q[j] = q[a[j]]; q[a[j]] = 0;
                    if (j == x) { q[j] = 2; ans = p[j]; }
                }
            }
        w[0] = true;
        for (int i = 1; i <= n; i++)
            if (q[i] == 1) {
                for (int j = n; j >= 0; j--)
                    if (w[j]) w[j + p[i]] = true;
            }
        
        for (int i = 0; i <= n; i++)
            if (w[i]) System.out.println(i + ans);
    }
}
