#include<queue>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 const int oo=0x3f3f3f3f;

 struct pnt{

     int hd;

     int lyr;

     int now;

 }p[];

 struct ent{

     int twd;

     int lst;

     int vls;

 }e[];

 int k,n;

 int s,t;

 int cnt;

 int sum;

 std::queue<int>Q;

 void ade(int f,int t,int v)

 {

     cnt++;

     e[cnt].twd=t;

     e[cnt].vls=v;

     e[cnt].lst=p[f].hd;

     p[f].hd=cnt;

     return ;

 }

 bool Bfs(void)

 {

     while(!Q.empty())

         Q.pop();

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

         p[i].lyr=;

     p[s].lyr=;

     Q.push(s);

     while(!Q.empty())

     {

         int x=Q.front();

         Q.pop();

         for(int i=p[x].hd;i;i=e[i].lst)

         {

             int to=e[i].twd;

             if(p[to].lyr==&&e[i].vls>)

             {

                 p[to].lyr=p[x].lyr+;

                 if(to==t)

                     return true;

                 Q.push(to);

             }

         }

     }

     return false;

 }

 int Dfs(int x,int fll)

 {

     if(x==t)

         return fll;

     for(int& i=p[x].now;i;i=e[i].lst)

     {

         int to=e[i].twd;

         if(p[to].lyr==p[x].lyr+&&e[i].vls>)

         {

             int ans=Dfs(to,std::min(fll,e[i].vls));

             if(ans>)

             {

                 e[i].vls-=ans;

                 e[((i-)^)+].vls+=ans;

                 return ans;

             }

         }

     }

     return ;

 }

 int Dinic(void)

 {

     int ans=;

     while(Bfs())

     {

         int dlt;

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

             p[i].now=p[i].hd;

         while(dlt=Dfs(s,oo))

             ans+=dlt;

     }

     return ans;

 }

 int main()

 {

     //freopen("a.in","r",stdin);

     scanf("%d%d",&k,&n);

     s=k+n+;

     t=s+;

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

     {

         int v;

         scanf("%d",&v);

         sum+=v;

         ade(i,t,v);

         ade(t,i,);

     }

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

     {

         int p;

         scanf("%d",&p);

         ade(s,i+k,);

         ade(i+k,s,);

         for(int j=;j<=p;j++)

         {

             int tp;

             scanf("%d",&tp);

             ade(i+k,tp,);

             ade(tp,i+k,);

         }

     }

     int tot=Dinic();

     if(tot!=sum)

     {

         printf("No Solution!\n");

         return ;

     }

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

     {

         printf("%d:",i);

         for(int j=p[i].hd;j;j=e[j].lst)

         {

             int to=e[j].twd;

             if(to!=t&&e[j].vls>)

                 printf(" %d",to-k);

         }

         puts("");

     }

     return ;

 }