#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 105;
vector<int> ans;
int cnt[maxn];
int n,m,r,a[maxn],b[maxn];
int main() {
    freopen("killer.in","r",stdin);
    freopen("killer.out","w",stdout);
    scanf("%d%d%d",&m,&n,&r);
    for(int i = 1;i <= m;++ i) {
        scanf("%d",&a[i]);
    }
    for(int i = 1;i <= n;++ i) {
        scanf("%d",&b[i]);
    }
    for(int i = 1;i <= n;++ i) {
        for(int k = 1;k <= m;++ k) {
            if(!(b[i] % a[k])) {
                ++ cnt[i];
            }
        }
        if(cnt[i] == m) {
            printf("%d",i);
            return 0;
        }
    }
    for(int i = 1;i <= n;++ i) {
        if(cnt[i] >= r) {
            ans.push_back(i);
        }
    }
    if(!ans.size()) {
        puts("0");
        return 0;
    }
    else {
        for(int i = 0;i < ans.size();++ i) {
            printf("%d ",ans[i]);
        }
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}