#include<bits/stdc++.h>

#define int long long

using namespace std;

inline int read(){
    int x=0,f=1;char c=getchar();
    for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
    for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
    return x*f;
}

int ksm(int y,int z,int p){
    y%=p;int ans=1;
    for(int i=z;i;i>>=1,y=y*y%p)if(i&1)ans=ans*y%p;
    return ans%p;
}

int inv(int x,int p){return ksm(x,p-2,p)%p;}

int gcd(int x,int y){return (y==0)?(x):(gcd(y,x%y));}
int lcm(int x,int y){return (x/gcd(x,y))*y;}

const int MN=105;
int n,m,r;
int a[MN],b[MN];

bool chk1(int x){
    for(int i=1;i<=n;i++)if(x%a[i]!=0)return 0;
    return 1;
}

signed main(void){

    freopen("killer.in","r",stdin);
    freopen("killer.out","w",stdout);
    n=read(),m=read(),r=read();
    for(int i=1;i<=n;i++)a[i]=read();
    for(int i=1;i<=m;i++)b[i]=read();

    for(int i=1;i<=m;i++){
        if(chk1(b[i])){cout<<i<<endl;return 0;}
    }

    for(int i=1;i<=m;i++){
        int cnt=0;
        for(int j=1;j<=n;j++)cnt+=(b[i]%a[j]==0);
        if(cnt>=r)cout<<i<<" ";
    }
    puts("");

    return 0;
}