#pragma GCC optimize("Ofast")
#pragma GCC optimize("avx2")
#pragma GCC optimize("unroll-loops")

#define ll int64_t

#include<bits/stdc++.h>
using namespace std;

const ll MAXN=1e4+1;
ll n,m;
ll cost[MAXN];
pair<ll,ll> sortedActors[MAXN];
vector<ll> scenesOfActor[MAXN];
vector<ll> actorsOfScene[MAXN];
ll fs[MAXN];
ll fa[MAXN];
bool fl[MAXN];
bool fr[MAXN];

void solve(){
    auto begtime=clock();
    cin>>n>>m;
    for(ll i=1;i<=n;i++){
        cin>>cost[i];
        sortedActors[i].first=-cost[i];
        sortedActors[i].second=i;
    }
    ll br,tActor;
    for(ll i=1;i<=m;i++){
        cin>>br;
        for(ll j=0;j<br;j++){
            cin>>tActor;
            scenesOfActor[tActor].push_back(i);
            actorsOfScene[i].push_back(tActor);
        }
    }

    vector<ll> v;

    sort(sortedActors+1,sortedActors+1+n);
    set<pair<ll,ll> > nextActors;
    nextActors.insert(sortedActors[1]);
    fa[sortedActors[1].second]=1;
    ll p=1;
    set<pair<pair<ll,ll>,ll> > tSortedActors;
    for(ll i=1;i<=n;i++){
        if(nextActors.empty()){
            while(fa[sortedActors[p].second]==1) p++;
            nextActors.insert(sortedActors[p]);
        }
        tActor=nextActors.begin()->second;
        nextActors.erase(nextActors.begin());
        tSortedActors.clear();
        for(auto tScene : scenesOfActor[tActor]) if(fs[tScene]==0){
            if(actorsOfScene[tScene].size()==1){
                fs[tScene]=1;
                //cout<<tScene<<" ";
                v.push_back(tScene);
                continue;
            }
            for(auto ta : actorsOfScene[tScene]){
                if(ta!=tActor) tSortedActors.insert({{fa[ta],-cost[ta]},ta});
                if(fa[ta]==0){
                    nextActors.insert({-cost[ta],ta});
                    fa[ta]=1;
                }
            }
            fs[tScene]=2;
        }
        stack<ll> st;
        for(auto it : tSortedActors){
            for(auto tScene : scenesOfActor[it.second]) if(fs[tScene]==2){
                fs[tScene]=1;
                st.push(tScene);
            }
        }
        while(!st.empty()){
            //cout<<st.top()<<" ";
            v.push_back(st.top());
            st.pop();
        }
    }

    ll lb[MAXN],rb[MAXN];
    for(ll i=1;i<=n;i++){
        lb[i]=LLONG_MAX;
        rb[i]=-1;
    }
    for(ll i=0;i<v.size();i++){
        ll tScene=v[i];
        for(auto tActor : actorsOfScene[tScene]){
            lb[tActor]=min(lb[tActor],i);
            rb[tActor]=max(rb[tActor],i);
        }
    }
    ll val;
    while(double(clock()-begtime)/CLOCKS_PER_SEC<5){
    for(ll i=0;i<v.size()-1;i++){
        val=0;
        for(auto tActor : actorsOfScene[v[i]]) fl[tActor]=1;
        for(auto tActor : actorsOfScene[v[i+1]]) fr[tActor]=1;

        for(auto tActor : actorsOfScene[v[i]]){
            if(fr[tActor]) continue;
            if(i==lb[tActor]) val+=cost[tActor];
            else if(i==rb[tActor]) val-=cost[tActor];
        }
        for(auto tActor : actorsOfScene[v[i+1]]){
            if(fl[tActor]) continue;
            if(i==lb[tActor]) val-=cost[tActor];
            else if(i==rb[tActor]) val+=cost[tActor];
        }

        for(auto tActor : actorsOfScene[v[i]]) fl[tActor]=0;
        for(auto tActor : actorsOfScene[v[i+1]]) fr[tActor]=0;
        if(val>0){
            for(auto tActor : actorsOfScene[v[i]]){
                if(lb[tActor]==i) lb[tActor]=i+1;
                lb[tActor]=min(lb[tActor],i+1);
                rb[tActor]=max(rb[tActor],i+1);
            }
            for(auto tActor : actorsOfScene[v[i+1]]){
                if(rb[tActor]==i+1) rb[tActor]=i;
                lb[tActor]=min(lb[tActor],i);
                rb[tActor]=max(rb[tActor],i);
            }
            swap(v[i],v[i+1]);
        }
    }
    }
    for(auto i : v) cout<<i<<" ";
}

int main()
{
    freopen("star.in","r",stdin); freopen("star.out","w",stdout);

    ios_base::sync_with_stdio(false); cin.tie(NULL);

    ll t=1;
    //cin>>t;
    while(t--) solve();

    return 0;
}