#pragma GCC optimize("Ofast,unroll-loops")
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int o=15010;
int n,m,a[o],a_[o],b[o],p[o],s,v[o],fa[o*2],f[o][o],cnt[o],st[o],tp,q[o];vector<int> vec[o];
inline bool cmp(int A,int B){return a[A]>a[B];}
inline bool Cmp(int A,int B){return st[A]>st[B];}
int fr(int x){return fa[x]==x?x:fa[x]=fr(fa[x]);}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%d",&a[i]),p[i]=i,s+=a[i];
	sort(p+1,p+n+1,cmp);
	scanf("%d",&m);
	for(int i=1;i<=m;++i) scanf("%d",&b[i]);
	for(int i=n;i;--i) a_[i]=a_[i+1]+a[p[i]];
	for(int i=s+1;i<=s*2;++i) fa[i]=i;
	f[m+1][0]=1;
	for(int i=m;i;--i){
		for(int j=0;j<=s;++j) fa[j]=j;
		for(int j=0,k=1;j<=s;j+=b[i]-b[i-1],++k) v[j]=k;
		for(int j=s,lim;j+1;--j) if(f[i+1][j]){
			lim=(s-j)/b[i];
			for(int k=b[i];k>b[i-1];--k) lim=min(lim,(a_[k]-j)/(b[i]-k+1));
			lim=j+(b[i]-b[i-1])*lim;
			for(int t=j+(b[i]-b[i-1])*(f[i+1][j]-1);t<=lim&&(t=fr(t))<=lim;t=fa[t]) f[i][t]=v[t-j],fa[t]=t+b[i]-b[i-1];
		}
	}
	if(!f[1][s]){printf("-1");return 0;}
	printf("%d\n",f[1][s]-1);
	for(int i=1,j=s;i<=m;++i) cnt[i]=--f[i][j],j-=(b[i]-b[i-1])*f[i][j];
	for(int i=1;i<=m;++i) for(int j=cnt[i]-cnt[i+1];j--;) st[++tp]=b[i];
	for(int i=1;i<=tp;++i) q[i]=i;
	for(int i=1;i<=n;++i){
		nth_element(q+1,q+a[p[i]],q+tp+1,Cmp);
		for(int j=1;j<=a[p[i]];++j) vec[q[j]].push_back(p[i]),--st[q[j]];
	}
	for(int i=1;i<=tp;++i,putchar('\n')){
		printf("%llu ",vec[i].size());
		for(int j=vec[i].size();j--;) printf("%d ",vec[i][j]);
	}
	return 0;
}