#include <bits/stdc++.h>
using namespace std;
#define MAX 31234567

struct X
{
    int s;
    int ub;
    int c;
    int m;


} pole[MAX];

int pre[MAX];
int n, q;
int pom;

int out[MAX];




int main()
{
    cin >> n >> q;
    while(n>=MAX or q>=MAX)
    {
        return 0;
    }
    for(int i=1; i<n; i++)
    {
        cin >> pom;
        pole[pom].s++;
        pre[i]=pom;
    }

    pole[0].c=1;
    pole[0].m=0;

    for(int i=0; i<n; i++)
    {
    //cout << i << " " << pre[i] << endl;
        int kde = i;
        if(i>0)
        {
            pole[kde].c = pole[pre[kde]].s*pole[pre[kde]].c;
            pole[kde].m = pole[pre[kde]].ub*pole[pre[kde]].c+pole[pre[kde]].m;
            pole[pre[kde]].ub++;
        }

        //cout << kde << " " << pole[kde].c << " " << pole[kde].m << endl;

        if(pole[kde].s==0)
        {
            //while(pole[kde].m<q)
            {
                out[pole[kde].m]=kde;
                pole[kde].m += pole[kde].c;
            }
        }
    }




    for(int i=0; i<q; i++)
    cout << out[i] << '\n';
    cout << endl;




    return 0;
}