#include <stdio.h>
#include <memory.h>
#define mod 998244353
char buf[1 << 20], *pp1, *pp2;
#define GC (pp1==pp2&&(pp2=(pp1=buf)+fread(buf,1,1<<20,stdin),pp1==pp2)?0:*pp1++)
inline int R() {
    char t = GC;
    int x = 0;

    while (t < '!')
        t = GC;

    while (t >= '!')
        x = x * 10 + t - 48, t = GC;

    return x;
}
char pbuf[1 << 20], *pp = pbuf;
void push(const char c) {
    if (pp - pbuf == (1 << 20))
        fwrite(pbuf, 1, (1 << 20), stdout), pp = pbuf;

    *pp++ = c;
}
inline void W(int x) {
    static int sta[35];
    int top = 0;

    do {
        sta[top++] = x % 10, x /= 10;
    } while (x);

    while (top)
        push(sta[--top] + '0');

    push(' ');
}
unsigned long long tmp[2097152];
int a_[2097152], l_ = -1;
inline long long Max(long long p, long long q) {
    return p > q ? p : q;
}
inline long long Min(long long p, long long q) {
    return p < q ? p : q;
}
inline void Mod(int &p) {
    p >= mod &&(p -= mod);
}
inline int gett(int p) {
    while (p ^ p & -p)
        p ^= p & -p;

    return p << 1;
}
inline void init(int n) {
    if (l_ == n)
        return;

    l_ = n;

    for (int i = 1; i < n; i++)
        a_[i] = i & 1 ? a_[i ^ 1] | n >> 1 : a_[i >> 1] >> 1;
}
inline int ksm(unsigned long long a, int b) {
    int ans = 1;

    while (b)
        (b & 1) && (ans = a * ans % mod), a = a * a % mod, b >>= 1;

    return ans;
}
inline void ntt(int a[], int n, int typ) {
    int q;
    init(n);

    for (int i = 0; i < n; i++)
        if (i < a_[i])
            a[i] ^= a[a_[i]] ^= a[i] ^= a[a_[i]];

    tmp[0] = 1;

    for (int i = 1; i < n; i <<= 1) {
        if (i != 1)
            for (int j = i - 2, h = ksm(typ ? 332748118 : 3, (mod - 1 >> 1) / i); j >= 0; j -= 2)
                tmp[j | 1] = (tmp[j] = tmp[j >> 1]) * h % mod;

        for (int j = 0; j < n; j += i << 1)
            for (int k = 0; k < i; k++)
                q = tmp[k] * a[i + j + k] % mod, Mod(a[i + j + k] = a[j + k] + mod - q), Mod(a[j + k] += q);
    }

    if (typ)
        for (int i = 0, h = ksm(n, mod - 2); i < n; i++)
            a[i] = 1ull * a[i] * h % mod;
}
inline void mul(int a[], int b[], int n) {
    ntt(a, n, 0);
    ntt(b, n, 0);

    for (int i = 0; i < n; i++)
        a[i] = 1ull * a[i] * b[i] % mod;

    ntt(a, n, 1);
}
int a[2097152], b[2097152], t1[2097160], t2[2097160], cnt[2097160], n, m, s, l, g[2097160], tmpt[2097160];
unsigned long long tmp0[50][31000];
inline void add(int p, int q) {
    tmp0[p][q >> 6] |= 1ull << (q & 63);
}
inline int get(int p, int q) {
    int v = tmp0[p][q >> 6] >> (q & 63) & 1;

    if (v)
        tmp0[p][q >> 6] ^= 1ull << (q & 63);

    return v;
}
inline int push(int p, long long v) {
    int cnt = 0;

    while (v) {
        if (v & 1)
            add(cnt, p);

        v >>= 1;
        cnt++;
    }

    return cnt;
}
void add(int pos) {
    if (pos < 0)
        return;

    if (pos == 0)
        return add(1);

    if (g[pos]) {
        g[pos]--;
        add(pos - 2);
        add(pos + 1);
    } else if (g[pos + 1]) {
        g[pos + 1] = 0;
        add(pos + 2);
    } else if (g[pos - 1]) {
        g[pos - 1] = 0;
        add(pos + 1);
    } else
        g[pos] = 1;
}
long long c[5097160];
int main() {
    s = R();

    while (s--) {
        n = R();

        for (int i = 1; i <= n; i++)
            a[i] = R();

        m = R();

        for (int i = 1; i <= m; i++)
            b[i] = R();

        l = gett(n + m + 1);
        memset(c, 0, sizeof(long long) * (l + 6));
        memset(t1, 0, sizeof(int) * (l + 4));
        memset(t2, 0, sizeof(int) * (l + 4));
        memset(cnt, 0, sizeof(int) * (l + 4));
        memset(g, 0, sizeof(int) * (l + 4));

        for (int i = 1; i <= n; i++)
            t1[i] = a[i];

        for (int i = 1; i <= m; i++)
            t2[i] = b[i];

        mul(t1, t2, l);

        for (int i = 0; i < l; i++)
            cnt[i] += t1[i];

        memset(t1, 0, sizeof(int) * (l + 4));
        memset(t2, 0, sizeof(int) * (l + 4));

        for (int i = 1; i <= n; i++)
            t1[i] = a[i];

        for (int i = 1; i <= m; i++)
            t2[m - i] = i & 1 ? mod - b[i] : b[i];

        mul(t1, t2, l);

        for (int i = 0; i < l; i++)
            if (m + i + 2 < l)
                cnt[i] += t1[m + i + 2] >= 1e8 ? t1[m + i + 2] - mod : t1[m + i + 2];

        memset(t1, 0, sizeof(int) * (l + 4));
        memset(t2, 0, sizeof(int) * (l + 4));

        for (int i = 1; i <= n; i++)
            t1[n - i] = i & 1 ? mod - a[i] : a[i];

        for (int i = 1; i <= m; i++)
            t2[i] = b[i];

        mul(t1, t2, l);

        for (int i = 0; i < l; i++)
            if (n + i + 2 < l)
                cnt[i] += t1[n + i + 2] >= 1e8 ? t1[n + i + 2] - mod : t1[n + i + 2];

        for (int i = 0; i < 4; i++) {
            int top = (l >> 2) << 2 | i;

            while (top < l)
                top += 4;

            while (top >= l)
                top -= 4;

            long long cntt = 0;

            for (int i = top; i >= 0; i -= 4) {
                cntt += cnt[i];
                c[i] += cntt;

                if (i >= 2)
                    c[i - 2] -= cntt;
            }
        }

        l += 2;

        for (int i = 0; i <= l; i++)
            if (c[i] < 0)
                i && (c[i - 1] -= c[i]), c[i + 1] += c[i], c[i] = 0;

        c[1] += c[0], c[0] = 0;
        int dep = 0;

        for (int i = 1; i <= l; i++) {
            int v = push(i, c[i]);

            if (dep < v)
                dep = v;
        }

        for (int i = dep - 1; ~i; i--) {
            memcpy(tmpt, g, sizeof(int) * (l + 4));
            memset(g, 0, sizeof(int) * (l + 4));

            for (int j = l; j >= 1; j--) {
                if (get(i, j))
                    add(j);

                if (tmpt[j])
                    add(j), add(j);
            }
        }

        int TOP = l + 2;

        while (!g[TOP])
            TOP--;

        W(TOP);

        for (int i = 1; i <= TOP; i++)
            W(g[i]);

        push('\n');
    }

    fwrite(pbuf, 1, pp - pbuf, stdout);
}
/*


























































































































*/