#include<bits/stdc++.h>
using namespace std;
long long int m,n,r,a[105],b[105];
struct rs{
	int tp,num;
}tmp[105];
bool cmp(rs a,rs b){
	return a.tp>b.tp;
}
int main(){
	freopen("killer.in","r",stdin);
	freopen("killer.out","w",stdout);
	memset(tmp,0,sizeof(tmp));
	cin>>m>>n>>r;
	int res[r];
	memset(res,0,sizeof(res));
	for(int i=0;i<m;++i){
		cin>>a[i];
	}
	for(int i=0;i<n;++i){
		cin>>b[i];
	}
	for(int i=0;i<n;++i){
		tmp[i].num = i;
		for(int j=0;j<m;++j){
			if(b[i]%a[j] != 0) continue;
			else tmp[i].tp++;
		}
		if(tmp[i].tp == m){
			cout<<i+1;
			return 0;
		}
	}
	sort(tmp,tmp+105,cmp);
	for(int i=0;i<r;++i){
		res[i] = tmp[i].num+1;
	}
	sort(res,res+r);
	for(int i=0;i<r;++i){
		cout<<res[i]<<' ';
	}
	return 0;
}