3 15
3 3 4
2 1 2
1 3
1 3
1 3
1 3
3 1 2 3
2 2 3
2 1 3
1 2
1 2
2 1 2
2 1 3
2 1 2
1 1
3 1 2 3

1: 1 6 8
2: 7 9 10
3: 2 3 4 5

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define ls i<<1
#define rs ls | 1
#define mid ((ll+rr)>>1)
#define pii pair<int,double>
#define MP make_pair
typedef long long LL;
typedef unsigned long long ULL;
const long long INF = 1e18+1LL;
const double pi = acos(-1.0);
const int N = 1e5+10, M = 1e3+20,inf = 2e9;int head[N],t=2,h[N],q[N],S,T,ans = 0;
struct edge{int to,next,v;}e[N * 2];
void adds(int u,int v,int w){e[t].to=v;e[t].v=w;e[t].next=head[u];head[u]=t++;}
void add(int u,int v,int w) {adds(u,v,w);adds(v,u,0);}
int bfs() {memset(h,-1,sizeof(h));int l=0,r=1,now;q[l]=S;h[S]=0;while(l!=r){now=q[l++];if(l == 100000) l=0;for(int i=head[now];i!=-1;i=e[i].next) {if(e[i].v&&h[e[i].to]==-1) {h[e[i].to]=h[now]+1;q[r++]=e[i].to;if(r==100000) r = 0;}}}if(h[T]==-1) return 0;else return 1;
}
int dfs(int x,int f) {if(x == T) return f;int used=0,w;for(int i=head[x]; i!=-1;i=e[i].next) {if(e[i].v&&h[e[i].to] == h[x] + 1) {w=dfs(e[i].to,min(f-used,e[i].v));used+=w;e[i].v-=w;e[i^1].v+=w;if(used == f) return f;}}return used;
}
void dinic() {while(bfs()) ans+=dfs(S,inf);}int k,n,a[N];
vector<int  >G[N];
int main() {scanf("%d%d",&k,&n);S = 2*(n+k)+1,T = S+1;t = 2;memset(head,-1,sizeof(head));int sum = 0;for(int i = 1; i <= k; ++i) {scanf("%d",&a[i]);add(S,i,a[i]);sum += a[i];}for(int i = 1; i <= n; ++i) {int x,y;scanf("%d",&x);for(int j = 1; j <= x; ++j) {scanf("%d",&y);add(y,i+k,1);}add(i+k,T,1);}ans = 0;dinic();if(ans != sum) puts("No Solution!");else {for(int i = 1; i <= k; ++i) {printf("%d:",i);for(int j = head[i]; j!=-1; j = e[j].next) {if(e[j].v == 0 && e[j].to!=S) {printf(" %d",e[j].to - k);}}printf("\n");}}return 0;
}