#pragma GCC optimize("Ofast,fast-math")
#include <stdio.h>
#include <bits/stdc++.h>

using namespace std;

bool _u;

typedef long long ll;
typedef double db;
typedef pair <int, int> pii;
#define ci const int
template <class T>
inline void chmax(T &x, const T &y) { if(x < y) x = y; }
template <class T>
inline void chmin(T &x, const T &y) { if(x > y) x = y; }
#define mp make_pair
#define fi first
#define se second
#define pc putchar
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define ppc __builtin_popcount
#define ctz __builtin_ctz
#define clr(a) memset(a, 0, sizeof(a))
#define rep(i, l, r) for(int i = l, i##end = r; i <= i##end; ++ i)
#define per(i, r, l) for(int i = r, i##end = l; i >= i##end; -- i)
#define fsub(T, S) for(int T = S, T##_f = T; T; T = (T - 1) & T##_f)
#define fsubm(T, S) for(int T = S, T##_f = T; T; T = (T - 1) & T##_f) if(T & (T##_f & -T##_f))
#define Sin(S, i) ((S) >> (i) & 1)

char inputbuf[1 << 23], *p1 = inputbuf, *p2 = inputbuf;
#define getchar() (p1 == p2 && (p2 = (p1 = inputbuf) + fread(inputbuf, 1, 1 << 23, stdin), p1 == p2) ? EOF : *p1++)
inline int read() {
	int res = 0; char ch = getchar(); bool f = true;
	for(; ch < '0' || ch > '9'; ch = getchar())
		f &= ch != '-';
	for(; ch >= '0' && ch <= '9'; ch = getchar())
		res = res * 10 + (ch ^ 48);
	return f ? res : -res;
}

const int N = 1e4 + 15, P = 1e9 + 9, i2 = (P + 1) / 2;

map <ll, ll> S;
int n, d, lim = 1e4, nf, ng;
ll X[N], Y[N];
ll g[N], f[N], h[N];
bool ill[N];

bool _v;

ll poww(ll x, ll y = P - 2) {
	ll res = 1;
	for(; y; y >>= 1, x = x * x % P)
		if(y & 1) res = res * x % P;
	return res;
}

ll mod(ll x) {
	return x >= P ? x - P : x;
}

void ins(int x) {
	per(i, n, 1) g[i] = mod(g[i - 1] - x * g[i] % P + P);
	g[0] = mod(P - x * g[0] % P);
}

void del(int x) {
	ll ix = poww(x);
	g[0] = (P - g[0]) * ix % P;
	rep(i, 1, n) g[i] = (g[i - 1] - g[i] + P) * ix % P;
}

void lgg() {
	clr(f); clr(g);
	g[0] = 1;
	rep(j, 1, n) ins(X[j]);
	rep(j, 1, n) {
		ll co = 1;
		rep(k, 1, n) if(k != j) co = co * (X[j] - X[k] + P) % P;
		co = poww(co) * Y[j] % P;
		del(X[j]);
		rep(k, 0, n) (f[k] += co * g[k]) %= P;
		ins(X[j]);
	}
}

#define exi { puts("-1"); return ; }

ll calc(ll x) {
	ll res = 0;
	per(i, d, 0) res = (res * x + h[i]) % P;
	return res;
}

void solve() {
	n = read();
	S.clear();
	clr(ill);
	ll y0 = -1;
	rep(i, 1, n) X[i] = read();
	rep(i, 1, n) Y[i] = read();
	rep(i, 1, n) {
		if(X[i] == 0) {
			y0 = Y[i];
			if(y0 == 0) exi
			continue;
		}
		if(S.find(X[i]) != S.end()) {
			if(S[X[i]] != Y[i]) exi
			continue;
		}
		S[X[i]] = Y[i];
		ll ix = poww(X[i]), y = Y[i];
		if(S.find(ix) != S.end())
			rep(j, 0, lim) {
				if(y != S[ix]) ill[j] = 1;
				(y *= ix) %= P;
			}
	}
	d = -1;
	per(i, lim, 0) if(!ill[i]) { d = i; break; }
	if(d == -1) exi
	rep(i, 1, n) if(X[i]) S[poww(X[i])] = Y[i] * poww(X[i], P - 1 - d) % P;
	n = 0;
	for(auto p : S) X[++ n] = p.fi, Y[n] = p.se;
	lgg();
	nf = ng = n;
	while(nf && !f[nf]) -- nf;
	while(ng && !g[ng]) -- ng;
	if(nf > d) exi
	rep(i, 0, d) h[i] = mod(f[i] + f[d - i]) * i2 % P;
	rep(i, 1, n) assert(calc(X[i]) == Y[i]);
	if(h[0] == 0 || y0 != -1 && h[0] != y0) {
		if(ng > d) exi
//		if(h[0] == 0) y0 = 1;
		ll k = (y0 - h[0] + P) * poww(mod(g[0] + g[d])) % P;
		rep(i, 0, d) (h[i] += k * (g[i] + g[d - i])) %= P;
	}
	printf("%d\n", d);
	rep(i, 0, d) printf("%lld ", h[i]);
	pc(10);
}

signed main() {
//	freopen("yinfuxixuer.in", "r", stdin);
	//freopen("yinfuxixuer.out", "w", stdout);
	int T = read();
	while(T --) solve();
	return 0;
}