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

const long long MAXN=1e5;
const long long MAXM=(1e3)*5;
/*
nachalo na vhodnite p
*/

long long n, m;
vector<pair<long long, long long>>c;
vector<long long>sceni[MAXM+10];

vector<long long>anses1;
vector<long long>anses2;
vector<long long>anses3;
vector<long long>anses4;

/*
kraj na vhodnite p
*/

/// BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB

/*
solve1 start p
*/

vector<long long>graph[MAXN+10];
bool vis[MAXM+10];
long long secmax[MAXM+10];
long long c1[MAXN+10];

bool cmp(long long sc1, long long sc2)
{
    return c1[secmax[sc1]]>c1[secmax[sc2]];
}

/*
solve1 end p
*/

/*
solve2 start p
*/

vector<long long>graphs2[MAXN+10];
bool viss2[MAXM+10];
bool viss3[12];
vector<long long>relate[MAXN+10];

/*
solve2 end p
*/

void fastIO()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void input()
{
    cin>>n>>m;
    for (long long i=1; i<=n; i++)
    {
        long long x;
        cin>>x;
        c.push_back({x, i});
        c1[i]=x;
    }
    for (long long i=1; i<=m; i++)
    {
        long long br;
        cin>>br;
        for (long long j=1; j<=br; j++)
        {
            long long x;
            cin>>x;
            sceni[i].push_back(x);
        }
    }
}

long long pay(vector<long long>v)
{
    long long br[n+10]= {};
    long long currbr[n+10]= {};

    for (long long i=0; i<v.size(); i++)
    {
        long long scena=v[i];

        for (long long j=0; j<sceni[scena].size(); j++)
        {
            br[sceni[scena][j]]++;
        }
    }

    long long curr=0;
    long long ans=0;
    for (long long i=0; i<v.size(); i++)
    {
        ans+=curr;
        long long scena=v[i];
        for (long long j=0; j<sceni[scena].size(); j++)
        {
            currbr[sceni[scena][j]]++;
            if (currbr[sceni[scena][j]]==1) curr+=c1[sceni[scena][j]];
            if (currbr[sceni[scena][j]]==br[sceni[scena][j]]) curr-=c1[sceni[scena][j]];
        }
    }



    return ans;
}


/*
first solve start
*/

void solve1()
{
    vector<pair<long long, long long>>v;
    for (long long scena=1; scena<=m; scena++)
    {
        long long mx1=-1;
        long long ind1=0;
        long long mx2=-1;
        long long ind2=0;
        for (long long i=0; i<sceni[scena].size(); i++)
        {
            long long person=sceni[scena][i];
            //graph[person].push_back(scena);
            if (c1[person]>mx1)
            {
                ind2=ind1;
                mx2=mx1;

                mx1=c1[person];
                ind1=person;
            }
            else
            {
                if (c1[person]>mx2)
                {
                    ind2=person;
                    mx2=c1[person];
                }
            }
        }

        secmax[scena]=ind2;
        v.push_back({mx2, scena});
    }
    sort(v.begin(), v.end());

    for (long long scena1=0; scena1<m; scena1++)
    {
        long long scena=v[scena1].second;

        for (long long i=0; i<sceni[scena].size(); i++)
        {
            long long person=sceni[scena][i];
            graph[person].push_back(scena);
        }
    }

    sort(c.begin(), c.end(), greater<>());

    for (long long i=0; i<c.size(); i++)
    {
        long long person=c[i].second;
        long long cena=v[i].first;

        for (long long j=0; j<graph[person].size(); j++)
        {
            long long scena=graph[person][j];
            if (!vis[scena])
            {
                vis[scena]=true;
                anses1.push_back(scena);
            }
        }
    }
    //cout<<endl;
}

/*
first solve end
*/

/*
second solve start
*/

void solve2()
{
    for (long long i=1; i<=m; i++)
    {
        for (long long j=0; j<sceni[i].size(); j++)
        {
            relate[sceni[i][j]].push_back(i);
        }
    }

    sort(c.begin(), c.end(), greater<>());

    for (long long i=0; i<c.size(); i++)
    {
        long long curr=c[i].second;

        for (long long j=0; j<relate[curr].size(); j++)
        {
            if (viss2[relate[curr][j]]) continue;
            viss2[relate[curr][j]]=true;
            graphs2[curr].push_back(relate[curr][j]);
        }
    }

    deque<long long>dq;
    dq.push_back(c[0].second);

    for (long long ind=1; ind<c.size(); ind++)
    {
        long long curr=c[ind].second;

        deque<long long>dqc=dq;
        vector<long long>v;
        while (dq.size())
        {
            v.push_back(dq.front());
            dq.pop_front();
        }

        dq=dqc;



        long long ans1=0;


        vector<long long>psceni;

        for (long long i=0; i<graphs2[curr].size(); i++)
        {
            psceni.push_back(graphs2[curr][i]);
        }

        for (long long i=0; i<v.size(); i++)
        {
            long long scena=v[i];

            for (long long j=0; j<graphs2[scena].size(); j++)
            {
                psceni.push_back(graphs2[scena][j]);
            }
        }

        ans1=pay(psceni);

        long long ans2=0;

        psceni={};

        for (long long i=0; i<v.size(); i++)
        {
            long long scena=v[i];

            for (long long j=0; j<graphs2[scena].size(); j++)
            {
                psceni.push_back(graphs2[scena][j]);
            }
        }

        for (long long i=0; i<graphs2[curr].size(); i++)
        {
            psceni.push_back(graphs2[curr][i]);
        }

        ans2=pay(psceni);


        if (ans1<=ans2) dq.push_front(curr);
        else dq.push_back(curr);
    }


    deque<long long>dqc=dq;
    vector<long long>v;
    while (dq.size())
    {
        v.push_back(dq.front());
        dq.pop_front();
    }

    dq=dqc;

    for (long long i=0; i<v.size(); i++)
    {
        long long scena=v[i];

        for (long long j=0; j<graphs2[scena].size(); j++)
        {
            anses2.push_back(graphs2[scena][j]);
        }
    }
}

/*
second solve end
*/



void solve3()
{
    deque<long long>dq;
    dq.push_back(anses1[0]);

    for (long long i=1; i<anses1.size(); i++)
    {

        long long curr=anses1[i];

        deque<long long>dqc=dq;
        vector<long long>v;
        while (dq.size())
        {
            v.push_back(dq.front());
            dq.pop_front();
        }

        dq=dqc;


        long long ans1=0;

        vector<long long>psceni;

        psceni.push_back(curr);
        for (long long i=0; i<v.size(); i++) psceni.push_back(v[i]);

        ans1=pay(psceni);


        long long ans2=0;

        psceni={};


        for (long long i=0; i<v.size(); i++) psceni.push_back(v[i]);
        psceni.push_back(curr);

        ans2=pay(psceni);

        if (ans1>ans2) dq.push_back(curr);
        else dq.push_front(curr);
    }

    deque<long long>dqc=dq;
    vector<long long>v;
    while (dq.size())
    {
        v.push_back(dq.front());
        dq.pop_front();
    }
    anses3=v;
    dq=dqc;
}



void solve4()
{
    deque<long long>dq;
    dq.push_back(anses2[0]);

    for (long long i=1; i<anses2.size(); i++)
    {

        long long curr=anses2[i];

        deque<long long>dqc=dq;
        vector<long long>v;
        while (dq.size())
        {
            v.push_back(dq.front());
            dq.pop_front();
        }

        dq=dqc;


        long long ans1=0;

        vector<long long>psceni;

        psceni.push_back(curr);
        for (long long i=0; i<v.size(); i++) psceni.push_back(v[i]);

        ans1=pay(psceni);


        long long ans2=0;

        psceni={};


        for (long long i=0; i<v.size(); i++) psceni.push_back(v[i]);
        psceni.push_back(curr);

        ans2=pay(psceni);

        if (ans1>ans2) dq.push_back(curr);
        else dq.push_front(curr);
    }

    deque<long long>dqc=dq;
    vector<long long>v;
    while (dq.size())
    {
        v.push_back(dq.front());
        dq.pop_front();
    }
    anses4=v;
    dq=dqc;
}




void output(vector<long long>o)
{
    for (long long i=0; i<o.size(); i++)
    {
        cout<<o[i]<<" ";
    }
    cout<<endl;
}


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

    fastIO();
    input();


    solve1();



    if (n*m<=10'000'000)
    {
        solve3();

        //output(anses3);
        //output(anses1);

        if (pay(anses1)>pay(anses3)) anses1=anses3;

        solve2();
        solve4();
        if (pay(anses2)>pay(anses4)) anses2=anses4;


        if (pay(anses1)>pay(anses2))
        {
            output(anses2);
            //cout<<pay(anses2)<<endl;
        }
        else
        {
            output(anses1);
        }
        return 0;
    }
    output(anses1);
}