1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define PB push_back
#define ST first
#define ND second
#define DEBUG 0
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

vector<int> a, b;
vector<int> res;
int na, nb;

void add(int pos) {
	if (DEBUG) {
		printf("increase on: %d\n", pos);
	}
	res[pos] += 1;
	if (res[pos] == 2) {
		res[pos] = 0;
		if (pos == 0) {
			add(1);
		} else if (pos == 1) {
			add(2);
			add(0);
		} else {
			add(pos + 1);
			add(pos - 2);
		}
	} else if (pos > 0 && res[pos - 1] == 1) {
		res[pos - 1] = res[pos] = 0;
		add(pos + 1);
	} else if (res[pos + 1] == 1) {
		res[pos] = res[pos + 1] = 0;
		add(pos + 2);
	}
}

void testcase() {
	a.clear();
	b.clear();
	scanf("%d", &na);
	REP(i, na) {
		int x;
		scanf("%d", &x);
		if (x == 1) a.PB(i);
	}
	scanf("%d", &nb);
	REP(i, nb) {
		int x;
		scanf("%d", &x);
		if (x == 1) b.PB(i);
	}
	if (na > nb) {
		swap(na, nb);
		swap(a, b);
	}
	res.clear();
	int maxres = 4 * (na + nb);
	res.resize(maxres);
	// na <= nb
	for (auto k : a) {
		for (auto j : b) {
			if (DEBUG)printf("\t na poz: %d\n", j);
			int p1 = k, p2 = j;
			if (p1 > p2) {
				swap(p1, p2);
			}
			// p1 <= p2
			// on position p2 I have F_p1
			int position = p2, mow = 0;
			while (p1 >= 1) {
				add(position + p1 - mow);
				p1 -= 2;
				mow += 2;
			}
			int wsk = position - mow;
			if (wsk <= 0) {
				wsk = 0;
			}
			add(wsk);
		}
	}
	int roz = maxres;
	while (res[roz - 1] == 0) {
		--roz;
	}
	printf("%d ", roz); REP(i, roz) printf("%d ", res[i]); printf("\n");
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		testcase();
	}
	return 0;
}