/*
TASK:trees
LANG:C++
*/
#include<iostream>
#include<stdlib.h>
#include<math.h>
using namespace std;

int sort_f(const void *a, const void *b)
{
return *(int*)a>*(int*)b?-1:1;
}

int *row[30000];
int nrows;
int rowl[30000];

class ctree;
ctree *tree;
class ctree
{
public:

int nnext;
int n1[10];
int*n2,*n3,*n4;
int prev;
int row;
bool prot;

void setprot(void)
{
prot=true;
if(prev!=0)
tree[prev].setprot();
}

void addnext (int i)
{
if(nnext==10)
n2=new int(90);
else if (nnext==100)
n3=new int(900);
else if(nnext==1000)
n4=new int(29001);
if(nnext<10)
n1[nnext]=i;
else if(nnext<100)
n2[nnext-10]=i;
else if(nnext<1000)
n3[nnext-100]=i;
else
n4[nnext-1000]=i;
nnext++;
}
int getnext(int i)
{
if(i<10)
return n1[i];
else if(i<100)
return n2[i-10];
else if(i<1000)
return n3[i-100];
else
return n4[i-1000];
}

};

int main()
{
int n, m, per;
cin>>n>>m>>per;
per=ceil(double(per*n)/double(100));
tree=new ctree [n+1];
int h;
for(int i=0;i<=n;i++)
	tree[i].nnext=0;
for(int i=1;i<=n;i++)
	{
	cin>>h;
	tree[i].prev=h;
	tree[h].addnext(i);
	tree[i].prot=false;
	};
for(int i=0;i<m;i++)
	{
	cin>>h;
	tree[h].setprot();
	};
for(int i=0;i<30000;i++)
	{
	if(i==0)
		{
		rowl[0]=tree[0].nnext;
		row[0]=new int[rowl[0]];
		for(int j=0;j<rowl[0];j++)
			row[0][j]=tree[0].getnext(j);
		if(rowl[0]==0)
		{
		nrows=0;
		break;
		};
		continue;
		};
	int s=0;
	for(int j=0;j<rowl[i-1];j++)
		s+=tree[row[i-1][j]].nnext;
	row[i]=new int[s];
	int u=0;
	for(int j=0;j<rowl[i-1];j++)
		for(int k=0;k<tree[row[i-1][j]].nnext;k++)
			{
			row[i][u]=tree[row[i-1][j]].getnext(k);
			u++;
			};
	rowl[i]=u;
	if(rowl[i]==0)
		{
		nrows=i;
		break;
		};
	};
/*cout<<tree[0].nnext;
cout<<"-"<<nrows<<"-";
for(int i=0;i<nrows;i++)
for(int j=0;j<rowl[i];j++)
cout<<row[i][j];
cin>>n;*/
int *cut=new int[per];
int pt=0; int spt=0;
for(int i=nrows-1;i>=0;i--)
	{
	for(int j=0;j<rowl[i];j++)
		if(!tree[row[i][j]].prot)
			{cut[pt]=row[i][j];pt++;};
if(pt>per)
{
qsort((void *)(cut+spt), pt-spt, sizeof(int), sort_f);
pt=per;
break;
};
	spt=pt;
	};
qsort((void *)cut, per, sizeof(int), sort_f);
for(int i=per-1;i>0;i--)
cout<<cut[i]<<" ";
cout<<cut[0]<<"\n";
return 0;
}
