#include<cstdio>
#define N 100009
#define M 800009

inline int read()
{
	register int ret = 0;
	register bool f = 1;
	register char ch = getchar();
	while (ch < '0' || ch > '9')
		(ch == '-') ? f = 0 : 0, ch = getchar();
	while (ch >= '0' && ch <= '9')
		ret = (ret << 1) + (ret << 3) + (ch ^ 48), ch = getchar();
	return f ? ret : -ret;
}

int s, t = 100000;

struct node
{
	int v, w, nxt;
}e[M];

int head[N], cnt = 1;

inline void add(int u, int v, int w)
{
	e[++ cnt].v = v, e[cnt].w = w, e[cnt].nxt = head[u], head[u] = cnt;
}

int dis[N], now[N];

#include<queue>

using std::queue;

#include<cstring>

using std::memset;

inline bool bfs()
{
	memset(dis, -1, sizeof dis);
	dis[s] = 0;
	now[s] = head[s];
	register queue < int > q;
	q.push(s);
	register int u, v, i;
	while (!q.empty())
	{
		u = q.front();
		q.pop();
		for (i = head[u];i;i = e[i].nxt)
		{
			v = e[i].v;
			if (e[i].w > 0 && dis[v] == -1)
			{
				dis[v] = dis[u] + 1;
				now[v] = head[v];
				if (v == t)
					return 1;
				q.push(v);
			}
		}
	}
	return 0;
}

#define min(a, b) (a < b ? a : b)

int dfs(register int u, register int flow)
{
	if (u == t)
		return flow;
	register int lost = flow, i, v, w, k;
	for (i = now[u];i && lost;i = e[i].nxt)
	{
		v = e[i].v, w = e[i].w;
		if (w > 0 && dis[v] == dis[u] + 1)
		{
			k = dfs(v, min(lost, w));
			if (!k)
			{
				dis[v] = -1;
				continue;
			}
			lost -= k;
			e[i].w -= k;
			e[i ^ 1].w += k;
		}
	}
	return flow - lost;
}

int st[309][309];

int main()
{
	register int n = read(), m = read(), i, j, ans = 0;
	for (i = 1;i <= n;++ i)
		add(s, i, read()), add(i, s, 0);
	for (i = 1;i <= m;++ i)
		add(i + n, t, read()), add(t, i + n, 0);
	for (i = 1;i <= n;++ i)
		for (j = 1;j <= m;++ j)	
		add(i, j + n, 1), add(j + n, i, 0);
	while (bfs())
		ans += dfs(s, 1e9);
	if (ans)
	{
		puts("1");
		for (i = 2;i <= cnt;i += 2)
		{
			if (e[i ^ 1].v != s && e[i].v != s && e[i ^ 1].v != t && e[i].v != t && e[i ^ 1].w)
			{
				st[e[i ^ 1].v][++ st[e[i ^ 1].v][0]] = e[i].v - n;
			}
		}
		for (i = 1;i <= m;++ i)
		{
			for (j = 1;j <= st[i][0];++ j)
				printf("%d ", st[i][j]);
			puts("");
		}
	}
	else
		putchar('0');
	
	return 0;
}