#include <bits/stdc++.h>
using namespace std;
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m;
	cin >> n;
	int arr[n];
	bool st1=true;
	for(int i=0; i<n; i++){
		cin >> arr[i];
		if(arr[i]!=1) st1=false;
	}
	cin >> m;
	vector<int> brr(m);
	for(int i=0; i<m; i++) cin >> brr[i];
	if(st1){
		for(int i=0; i<n; i++){
			for(int j=0; j<m; j++) brr.push_back(brr[j]);
		}
		m=brr.size();
		bitset<505> bs[m+1];
		bs[0][0]=1;
		for(int i=0; i<m; i++){
			bs[i+1]=bs[i]|(bs[i]<<brr[i]);
		}
		if(!bs[m][n]){
			cout << -1;
			return 0;
		}
		else{
			vector<int> ans;
			int cur=n;
			for(int i=m; i>0; i--){
				if(bs[i-1][cur]) continue;
				cur-=brr[i-1];
				ans.push_back(brr[i-1]);
			}
			cout << ans.size() << '\n';
			cur=1;
			for(int i:ans){
				cout << i << ' ';
				for(int j=0; j<i; j++){
					cout << cur << ' ';
					cur++;
				}
				cout << '\n';
			}
		}
	}
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |