#include <bits/stdc++.h>
using namespace std;
int item[1001];
int best=0,worst=2e9;
int good=0,bad=0;
int main() {
int N,K;
cin>>N>>K;
for(int n=0;n<K;n++){
int v;
cin>>v;
item[v]+=1;
}
for(int n=1;n<=N;n++){
if(item[n]>best)
best=item[n];
if(item[n]!=0 && item[n]<worst)
worst=item[n];
}
int last[N+1][1001];
for(int n=1;n<=N;n++){
cin>>last[n][0];
}
for(int n=1;n<=N;n++){
for(int m=1;m<=last[n][0];m++)
cin>>last[n][m];
}
for(int n=1;n<=N;n++){
for(int m=1;m<=last[n][0];m++){
if(last[n][m]==best)
good=n;
if(last[n][m]==worst)
bad=n;
}
}
cout<<good<<" "<<bad;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgoKaW50IGl0ZW1bMTAwMV07CmludCBiZXN0PTAsd29yc3Q9MmU5OwppbnQgZ29vZD0wLGJhZD0wOwppbnQgbWFpbigpIHsKCWludCBOLEs7CgljaW4+Pk4+Pks7Cglmb3IoaW50IG49MDtuPEs7bisrKXsKCQlpbnQgdjsKCQljaW4+PnY7CgkJaXRlbVt2XSs9MTsKCX0KCWZvcihpbnQgbj0xO248PU47bisrKXsKCQlpZihpdGVtW25dPmJlc3QpCgkJICBiZXN0PWl0ZW1bbl07CgkJaWYoaXRlbVtuXSE9MCAmJiBpdGVtW25dPHdvcnN0KQoJCSAgd29yc3Q9aXRlbVtuXTsKCX0KCWludCBsYXN0W04rMV1bMTAwMV07Cglmb3IoaW50IG49MTtuPD1OO24rKyl7CgkJY2luPj5sYXN0W25dWzBdOwoJfQoJZm9yKGludCBuPTE7bjw9TjtuKyspewoJCWZvcihpbnQgbT0xO208PWxhc3Rbbl1bMF07bSsrKQoJCSAgY2luPj5sYXN0W25dW21dOwoJfQoJZm9yKGludCBuPTE7bjw9TjtuKyspewoJCWZvcihpbnQgbT0xO208PWxhc3Rbbl1bMF07bSsrKXsKCQkgIGlmKGxhc3Rbbl1bbV09PWJlc3QpCgkJICAgIGdvb2Q9bjsKCQkgIGlmKGxhc3Rbbl1bbV09PXdvcnN0KQoJCSAgICBiYWQ9bjsKCQl9Cgl9Cgljb3V0PDxnb29kPDwiICI8PGJhZDsKfQ==