//minamoto

 #include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<queue>

 #define inf 0x3f3f3f3f

 using namespace std;

 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)

 char buf[<<],*p1=buf,*p2=buf;

 inline int read(){

     #define num ch-'0'

     char ch;bool flag=;int res;

     while(!isdigit(ch=getc()))

     (ch=='-')&&(flag=true);

     for(res=num;isdigit(ch=getc());res=res*+num);

     (flag)&&(res=-res);

     #undef num

     return res;

 }

 char sr[<<],z[];int C=-,Z;

 inline void Ot(){fwrite(sr,,C+,stdout),C=-;}

 inline void print(int x){

     if(C><<)Ot();

     while(z[++Z]=x%+,x/=);

     while(sr[++C]=z[Z],--Z);

 }

 const int N=,M=;

 int head[N],Next[M],ver[M],edge[M],cur[N],tot=;

 int dep[N],n,m,u,v,e,vis[N],s,t,sum=;

 queue<int> q;

 inline void add(int u,int v,int e){

     ver[++tot]=v,Next[tot]=head[u],head[u]=tot,edge[tot]=e;

     ver[++tot]=u,Next[tot]=head[v],head[v]=tot,edge[tot]=;

 }

 bool bfs(){

     memset(dep,-,sizeof(dep));

     while(!q.empty()) q.pop();

     for(int i=;i<=n+m+;++i) cur[i]=head[i];

     q.push(s),dep[s]=;

     while(!q.empty()){

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

         for(int i=head[u];i;i=Next[i]){

             int v=ver[i];

             if(dep[v]<&&edge[i])

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

         }

     }

     return ~dep[t];

 }

 int dfs(int u,int limit){

     if(!limit||u==t) return limit;

     int flow=,f;

     for(int i=cur[u];i;i=Next[i]){

         int v=ver[i];cur[u]=i;

         if(dep[v]==dep[u]+&&(f=dfs(v,min(limit,edge[i])))){

             flow+=f,limit-=f;

             edge[i]-=f,edge[i^]+=f;

             if(!limit) break;

         }

     }

     return flow;

 }

 int dinic(){

     int flow=;

     while(bfs()) flow+=dfs(s,inf);

     return flow;

 }

 int main(){

     m=read(),n=read();

     s=,t=n+m+;

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

         e=read(),add(s,i,e),sum+=e;

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

         add(i,j+m,);

     }

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

         e=read();add(i+m,t,e);

     }

     if(dinic()!=sum) return puts(""),;

     print(),sr[++C]='\n';

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

         for(int j=head[i];j;j=Next[j]){

             if(!edge[j]&&ver[j]>m&&ver[j]<=n+m)

             print(ver[j]-m),sr[++C]=' ';

         }

         sr[++C]='\n';

     }

     Ot();

     return ;

 }