#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cmath>

#include<cstring>

#include<queue>

using namespace std;

typedef long long ll;

inline int read()

{

    int x=,f=; char ch=getchar();

    while(ch<''||ch>'') { if(ch=='-') f=-; ch=getchar(); }

    while(ch>=''&&ch<='') { x=(x<<)+(x<<)+(ch^); ch=getchar(); }

    return x*f;

}

const int N=1e5+,INF=1e9+;

int fir[N],from[N<<],to[N<<],val[N<<],cntt=;

inline void add(int a,int b,int c)

{

    from[++cntt]=fir[a]; fir[a]=cntt;

    to[cntt]=b; val[cntt]=c;

    from[++cntt]=fir[b]; fir[b]=cntt;

    to[cntt]=a; val[cntt]=;

}

int n,m,sum,S,T;

queue <int> q;

int Fir[N],dep[N];

bool BFS()

{

    for(int i=;i<=T;i++) dep[i]=,Fir[i]=fir[i];

    q.push(S); dep[S]=;

    while(!q.empty())

    {

        int x=q.front(); q.pop();

        for(int i=fir[x];i;i=from[i])

        {

            int &v=to[i]; if(dep[v]||!val[i]) continue;

            dep[v]=dep[x]+; q.push(v);

        }

    }

    return dep[T]>;

}

int DFS(int x,int mif)

{

    if(x==T||!mif) return mif;

    int fl=,res;

    for(int i=Fir[x];i;i=from[i])

    {

        Fir[x]=i;

        int &v=to[i]; if(dep[v]!=dep[x]+||!val[i]) continue;

        if( res=DFS(v,min(mif,val[i])) )

        {

            fl+=res; mif-=res;

            val[i]-=res; val[i^]+=res;

            if(!mif) break;

        }

    }

    return fl;

}

int Dinic()

{

    int res=;

    while(BFS()) res+=DFS(S,INF);

    return res;

}

int main()

{

    m=read(); n=read(); S=; T=n+m+;

    int a;

    for(int i=;i<=m;i++)

    {

        a=read(); sum+=a;

        add(n+i,T,a);

    }

    for(int i=;i<=n;i++)

    {

        add(S,i,); a=read();

        for(int j=;j<=a;j++) add(i,n+read(),);

    }

    if(Dinic()!=sum) { printf("No Solution!"); return ; }

    for(int i=;i<=m;i++)

    {

        printf("%d:",i);

        for(int j=fir[n+i];j;j=from[j])

        {

            int &v=to[j]; if(v==T||!val[j]) continue;

            printf(" %d",v);

        } putchar('\n');

    }

    return ;

}