#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
#define int ll
//#define N
using namespace std;
const int N=15005;
int n,a[N],m,b[N];
vector<bitset<N>>dp[N];
void BellaKira()
{
	cin>>n;
	int all=0;
	for (int i=1;i<=n;i++)
		cin>>a[i],all+=a[i];
	// sort(a+1,a+n+1);
	cin>>m;
	for (int i=1;i<=m;i++)
		cin>>b[i];
	reverse(b+1,b+m+1);
	dp[0].resize(1);
	dp[0][0][0]=1;
	int mn=inf;
	for (int i=1;i<=m;i++)
	{
		bitset<N>now;
		dp[i].resize(all/b[i]+1);
		for (int j=0;j<=all/b[i];j++)
		{
			if (j<sz(dp[i-1]))
				now|=dp[i-1][j];
			int lim=0;
			for (int k=1;k<=n;k++) lim+=min(a[k],j);
			dp[i][j]=now;
			dp[i][j]<<=(N-lim-1);
			dp[i][j]>>=(N-lim-1);
			now<<=b[i];
		}
		for (int j=0;j<=all/b[i];j++)
			if (dp[i][j][all]==1)
			{
				mn=min(mn,j);
			}
	}
	for (int i=1;i<=m;i++)
	{
		for (int j=0;j<=all/b[i];j++)
			if (dp[i][j][all]==1&&j==mn)
			{
				cout<<j<<'\n';
				poly gg;
				int now=all,op=j;
				for (int x=i;x>=1;x--)
				{
					for (int y=0;y<=all/b[x];y++)
						if (now-y*b[x]>=0&&op-y<=(x==1?0:all/b[x-1]))
						{
							if (dp[x-1][op-y][now-y*b[x]])
							{
								op-=y;
								now-=y*b[x];
								for (int p=1;p<=y;p++)
									gg.push_back(b[x]);
								break;
							}
						}
				}
				reverse(gg.begin(),gg.end());
				priority_queue<pa>q;
				for (int x=1;x<=n;x++)
					q.push(mp(a[x],x));
				for (auto u:gg)
				{
					poly g;
					for (int j=1;j<=u;j++)
						g.push_back(q.top().se),q.pop();
					cout<<sz(g)<<' ';
					for (auto u:g) cout<<u<<" ";
					cout<<'\n';
					for (auto u:g) a[u]--,q.push(mp(a[u],u));
				}
				return;
			}
	}
	cout<<"-1\n";
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}