/*
TASK:trees
LANG:C++
*/
#include <iostream>
#include <cmath>
using namespace std;
int a[30000];
int b[30000][2]; // topologi4en sort
int c[30000]; // kloni s qica
int d[30000]; //izrqzani kloni
int n;
int m;
int per;


int main()
{
   cin >> n >> m >> per;
   int x, i;
   for(i=1; i<=n; i++)
   {
      cin >> a[i];
   }
   
   for(i=1; i<=m; i++) cin >> c[i];
   
   
   int l=1;
   while(l<=n)
   {
     for(i=0;i<=n; i++)
     {
        for(int j=1; j<=n; j++)
        if (a[j]==i)
        {
          b[l][0]=j;
          l++;
        }
     }
   }

   int def;
   for(i=1; i<=m; i++)
   {
      def=c[i];
      while(def!=0)
      {
         b[def][1]=1;
         def=a[def];
      }
   }
 
   
   double n2=n;
   int num=ceil(n2/100*per);
   
   int cut=0;  
   for(i=n; i>0; i--)
   {
       if(b[b[i][0]][1]!=1)
       {
           d[n-i]=b[i][0];
           cut++;
       }       
       if(cut==num)break;
   }
      

    for(i=0; i<cut; i++)
     for(int j=i+1; j<=cut; j++)
     {
       if(d[i]==0)d[i]=30001;
       if(d[j]==0)d[j]=30001;
       if(d[i]>d[j])
       {
          x=d[i];d[i]=d[j];d[j]=x;
       }
     }
       
    if(cut<num) cout << cut;
    else 
      for(i=0; i<cut-1; i++) cout << d[i] << " "; 
      cout << d[i];
      
    cout << endl;
      return 0;
}
       
