#include <bits/stdc++.h>

using namespace std;
const int N = 5e5+5, inf = 0x3f3f3f3f; 
int n, c[5], cc[5], a[N]; 

bool chk (int k) {
	int s, mn; s = mn = 0;
	for (int i = 0;i < 5;i++) cc[i] = c[i];  
	for (int i = 1;i <= n;i++) {
		int fl = 0; 
		for (int j = 4;j >= 0;j--) if (cc[j] && s+(j-2)-mn <= k) {
			cc[j]--; s += j-2; a[i] = j-2; mn = min(mn, s); fl = 1; break;  
		}
		if (!fl) return 0; 
	}
	return 1; 
}

void solve () {
	n = 0; 
	for (int i = 0;i < 5;i++) cin >> c[i], n += c[i]; 
	int l = -2, r = inf; 
	while (l < r) {
		int mid = l+r>>1; 
		if (chk(mid)) r = mid;
		else l = mid+1; 
	}
	cout << l << "\n"; 
	chk(l); 
	for (int i = 1;i <= n;i++) cout << a[i] << " "; cout << "\n"; 
}

int main () {
	ios::sync_with_stdio(0); 
	cin.tie(0); cout.tie(0); 
	int T; cin >> T;
	while (T--) solve(); 
	return 0; 
}