#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef int lint;
const lint inf = 0x3f3f3f3f;
const int maxn = 275;
const int maxm = 155;
struct dinic{
static const int N = 1005;
static const int M = 200005;
static const lint inf = 0x3f3f3f3f;
int he[N],ne[M],ver[M],d[N];
lint edge[M];
int s,t,tot;
queue<int> que;
void init( int n ){
for( int i = 0;i <= n;i++ ){
he[i] = 0;
}
tot = 1;
}
void add( int x,int y,lint z ){
ver[++tot] = y; ne[ tot ] = he[x]; he[x] = tot; edge[ tot ] = z;
ver[++tot] = x; ne[tot] = he[y]; he[y] = tot;edge[tot] = 0;
}
bool bfs(){
memset( d,0,sizeof( d ) );
while( que.size() ) que.pop();
que.push( s );
d[s] = 1;
while( que.size() ){
int x = que.front();
que.pop();
for( int cure = he[x];cure;cure = ne[cure] ){
int y = ver[cure];
if( edge[cure] && !d[y] ){
que.push( y );
d[ y ] = d[x] + 1;
if( y == t ) return 1;
}
}
}
return 0;
}
lint dfs( int x,lint flow ){
if( x== t ) return flow;
lint rest = flow,k;
for( int cure = he[x];cure && rest;cure = ne[cure] ){
int y = ver[cure];
if( edge[cure] && d[ y ] == d[x] + 1 ){
k = dfs( y,min( rest,edge[cure] ) );
if( !k ) d[ y ] = 0;
edge[cure] -= k;
edge[ cure^1 ] += k;
rest -= k;
}
}
return flow - rest;
}
lint max_flow( int x,int y ){
s = x; t = y;
lint maxflow = 0;
lint flow = 0;
while( bfs() )
while( flow = dfs( s,inf ) ) maxflow += flow;
return maxflow;
}
void solve(int m){
for( int i = 1;i <= m;i++ ){
for( int cure = he[i];cure;cure = ne[cure] ){
int y = ver[cure];
if( y == 0 ) continue;
if( !edge[cure] ){
printf("%d ", y-m );
}
}
puts("");
}
}
} g;
int num[maxm],c[maxn];
int main(){
int m,n,sum = 0;
scanf("%d%d",&m,&n);
for( int i = 1;i <= m;i++ ){
scanf("%d",&num[i]);
sum += num[i];
}
for( int i = 1;i <= n;i++ )scanf("%d",&c[i]);
int S = 0,T = n+m+1;
g.init(T);
for( int i = 1;i <= m;i++ ){
g.add( S,i,num[i] );
for( int j = 1;j <= n;j++ ){
g.add( i,j+m,1 );
}
}
for( int i = 1;i <= n;i++ ){
g.add( i+m,T,c[i] );
}
int maxflow = g.max_flow( S,T );
if( maxflow < sum ){
puts("0");
}else{
puts("1");
g.solve(m);
}
return 0;
}