#include<bits/stdc++.h>
#define MAXM 5001
#define MAXN 10001
using namespace std;
long long n,m;
set<int> s;
pair<long long,long long> pay[MAXN];
struct scene{
    vector<int> ars;
    long long ind;
};
bool cmp1(long long a,long long b){
    if(pay[a]>pay[b]) return true;
    return false;
}
vector<long long> order[MAXN];
bool cmp2(const scene& s1, const scene& s2) {
        long long sz=min(s1.ars.size(),s2.ars.size());
        long long osem5=55;
        sz=min(sz,osem5);
//code generated by ai - begin
    for (long long i = 0; i < sz; ++i) {
        long long valA = (i < s1.ars.size()) ? s1.ars[i] : LLONG_MIN;
        long long valB = (i < s2.ars.size()) ? s2.ars[i] : LLONG_MIN;

        if (valA < valB) {
            return true;
        } else if (valA > valB) {
            return false;
        }
    }
    return false;
//generated by ai - end
}
scene scs[MAXM];
long long hshF[MAXN],hshO[MAXN],quan[MAXN];
bool g[MAXN],g1[MAXN];
vector<long long> ans;
priority_queue<long long> pq;
long long SceneVal(long long currVal,long long in1,long long i2){
    long long ans1=0;
    for(long long i=0;i<order[in1].size();i++){
        long long oi=order[in1][i];
        if(g1[oi]) continue;
        for(long long i1=0;i1<scs[oi].ars.size();i1++){
            long long curr=scs[oi].ars[i1];
            quan[curr]--;
            if(quan[curr]==0) currVal-=pay[curr].first;
            if(quan[curr]==order[curr].size()) currVal+=pay[curr].first;
        }
        ans1+=currVal;
    }
    for(long long i=0;i<order[i2].size();i++){
        long long oi=order[i2][i];
        if(g1[oi]) continue;
        for(long long i1=0;i1<scs[oi].ars.size();i1++){
            long long curr=scs[oi].ars[i1];
            quan[curr]--;
            if(quan[curr]==0) currVal-=pay[curr].first;
            if(quan[curr]==order[curr].size()) currVal+=pay[curr].first;
        }
        ans1+=currVal;
    }
    for(long long i=0;i<order[in1].size();i++){
        long long oi=order[in1][i];
        if(g1[oi]) continue;
        for(long long i1=0;i1<scs[oi].ars.size();i1++){
            long long curr=scs[oi].ars[i1];
            quan[curr]++;
        }
    }
    for(long long i=0;i<order[i2].size();i++){
        long long oi=order[i2][i];
        if(g1[oi]) continue;
        for(long long i1=0;i1<scs[oi].ars.size();i1++){
            long long curr=scs[oi].ars[i1];
            quan[curr]++;
        }
    }
    return ans1;
}
int main(){
    freopen("star.in","r",stdin);
    freopen("star.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m;
    for(long long i=0;i<n;i++){
        cin>>pay[i].first;
        pay[i].second=i+1;
        s.insert(i);
    }
    sort(pay,pay+n);
    for(long long i=0;i<n;i++){
        hshO[i]=pay[i].second;
        hshF[pay[i].second]=i;
    }
    for(long long i=0;i<m;i++){
        long long br;
        scs[i].ind=i;
        cin>>br;
        for(long long i1=0;i1<br;i1++){
            long long x;
            cin>>x;
            x=hshF[x];
            quan[x]++;
            scs[i].ars.push_back(x);
        }
        sort(scs[i].ars.begin(),scs[i].ars.end(),cmp1);
    }
    sort(scs,scs+m,cmp2);
    for(long long i=0;i<m;i++){
        for(long long i1=0;i1<scs[i].ars.size();i1++){
            order[scs[i].ars[i1]].push_back(i);
        }
    }
    pq.push(1*n-1);
    g[n-1]=true;
    s.erase(n-1);
    /*for(long long i=0;i<n;i++){
        cout<<hshO[i]<<": \n";
        for(long long i1=0;i1<order[i].size();i1++){
            cout<<scs[order[i][i1]].ind<<" ";
        }
        cout<<"\n";
    }*/
    long long currVal=0;
    while(ans.size()<m){
        if(pq.empty()){
            long long num=*prev(s.end());
            g[num]=true;
            s.erase(num);
            pq.push(num);
        }
        long long fron=pq.top()*1;
        if(quan[fron]==0){
            pq.pop();
            continue;
        }
     //   cout<<hshO[fron]<<" "<<quan[fron]<<" bef\n";
        long long nw=LLONG_MAX-1,nw1=-1;
        if(m<5000){
            for(long long i=0;i<n;i++){
                if(quan[i]==0 || i==fron) continue;
                long long scv=SceneVal(currVal,i,fron);
                if(SceneVal(currVal,fron,i)>scv){
                    if(scv<nw){
                        nw1=i;
                        nw=scv;
                    }
                }
            }
        }
        if(nw1==-1) pq.pop();
        else fron=nw1;
       // cout<<hshO[fron]<<" "<<nw1<<" aft\n";
        g[fron]=true;
        for(long long i=0;i<order[fron].size();i++){
            long long oi=order[fron][i];
            if(g1[oi]) continue;
            ans.push_back(scs[oi].ind);
            g1[oi]=true;
            for(long long i1=0;i1<scs[oi].ars.size();i1++){
                long long curr=scs[oi].ars[i1];
                quan[curr]--;
                if(quan[curr]==0) currVal-=pay[curr].first;
                if(g[curr]) continue;
                g[curr]=true;
                s.erase(curr);
                pq.push(curr*1);
                currVal+=pay[curr].first;
            }
        }
    }
    for(long long i=0;i<m;i++){
        cout<<ans[i]+1<<" ";
    }
    cout<<"\n";
    return 0;
}