#include <iostream>
#include <queue>
#include <vector>
#include <bitset>

using namespace std;

int a[15007], suf[15007], val[15007], b[15007], ansc[15007];
pair<int, int> save[15007];
priority_queue<pair<int, int> > q;
bitset<15007> temp, bs[15007];
vector<bitset<15007> > v[15007];

int main(){
	int n, max_val = 0, sum = 0, m, ansx = -1;
	cin >> n;
	for (register int i = 1; i <= n; i++){
		cin >> a[i];
		suf[a[i]]++;
		max_val = max(max_val, a[i]);
		sum += a[i];
	}
	for (register int i = max_val; i >= 1; i--){
		suf[i] += suf[i + 1];
	}
	for (register int i = 1; i <= max_val; i++){
		val[i] = val[i - 1] + suf[i];
	}
	for (register int i = max_val + 1; i <= sum; i++){
		val[i] = sum;
	}
	bs[0][0] = true;
	for (register int i = 1; i <= sum; i++){
		bs[i] = bs[i - 1];
		for (register int j = val[i - 1] + 1; j <= val[i]; j++){
			bs[i][j] = true;
		}
	}
	cin >> m;
	for (register int i = 1; i <= m; i++){
		cin >> b[i];
	}
	v[m + 1].resize(1);
	v[m + 1][0][0] = true;
	for (register int i = m; i >= 1; i--){
		int size = v[i + 1].size();
		v[i].resize(sum / b[i] + 1);
		for (register int j = 0; b[i] * j <= sum; j++){
			if (j < size) v[i][j] = v[i + 1][j];
			if (j > 0){
				temp = v[i][j - 1];
				temp <<= b[i];
				v[i][j] |= temp;
			}
			v[i][j] &= bs[j];
		}
	}
	for (register int i = 0; i <= sum; i++){
		if (v[1][i][sum]){
			ansx = i;
			break;
		}
	}
	if (ansx == -1){
		cout << -1;
		return 0;
	}
	cout << ansx << endl;
	for (register int i = ansx, j = sum, k = 1; i >= 1; i--, j -= b[k]){
		while (!v[k][i][j] || !v[k][i - 1][j - b[k]]) k++;
		ansc[i] = b[k];
	}
	for (register int i = 1; i <= n; i++){
		q.push(make_pair(a[i], i));
	}
	for (register int i = 1; i <= ansx; i++){
		cout << ansc[i] << " ";
		for (register int j = 1; j <= ansc[i]; j++){
			save[j] = q.top();
			q.pop();
			cout << save[j].second << " ";
		}
		cout << endl;
		for (register int j = 1; j <= ansc[i]; j++){
			if (--save[j].first > 0) q.push(save[j]);
		}
	}
	return 0;
}