import java.util.Scanner;

public class 排队顺序 {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int n=scanner.nextInt();
        int [] a=new int[n];
        for(int i=0;i<n;i++){
            a[i]=scanner.nextInt();
        }
        int m=scanner.nextInt();
        int b=m;
        System.out.print(m+" ");
        for(int i=0;i<n;i++) {
            for (int j = 0; j < n; j++) {
                if (j == b - 1 && a[j] != 0) {
                    System.out.print(a[j] + " ");
                    b = a[j];
                }
            }
        }
    }
}