/*
TASK:TREES
LANG:C++
*/
#include <stdio.h>
#include <iostream>
    int begin;
    int rnk;
    int cnt = 1;
    int q[30000];
    int n,m,k,tmp,i,cut;
    int prev[30000],pre[30000],st[30000],son[30000][30];
    int used[30000],maxx;
    int stoi;
    using namespace std;
    
int main()
{

    scanf("%d %d %d",&n,&m,&k);
    for(i = 0;i < n;i++)
    {
              scanf("%d",&tmp);
              prev[i+1] = tmp;
              son[tmp][++son[tmp][0]] = i;
              st[i+1] = 1;
    }
    for(i = 0;i < m;i++)
    {
          scanf("%d",&pre[i]);
          tmp = pre[i];
          while(1)
          {
                        st[tmp] = 0;
                        if(prev[tmp] == 0)
                        {
                                     break;
                        }
                        tmp = prev[tmp-1];
          }
    }
    cnt = 1;
    q[begin] = 0;
    used[0] = 1;
    while(cnt <= n)
    {
              for(i = 1;i <= son[q[begin]][0];i++)
              {
                    if(used[son[q[begin]][i]+1] == 0)
                    {
                     q[cnt] = son[q[begin]][i]+1;
                     cnt++;
                     used[son[q[begin]][i]+1] = used[q[begin]]+1; 
                    }
              }
              begin++;
    }
    maxx = 0;
    for(i = 1;i <= n;i++)
    {
          stoi += st[i];
          if(maxx < used[i])maxx = used[i];
    }
    if((float)stoi/n < (float)k/100)
    {
                     printf("%d\n",stoi);
                     return 0;
    }
    else
    {
        rnk = (float)n*k/100.0+1;
        begin = 0;
        while(1)
        {
               for(i = n;i >= 1;i--)
               {     
                     if(st[i] && used[i] == maxx)
                     {
                              q[begin] = i;
                              begin++;
                              if(begin == rnk)
                              {
                                sort(q,q+begin);
                                for(i = 0;i < begin;i++)
                                {
                                          printf("%d ",q[i]);
                                }
                                printf("\n");
                                return 0;         
                              }
                     }
               }
               maxx--;
        }
        return 0;
    }
    
}
