#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

typedef complex<double> Cd;

const int N = 1000010, L = 21;

const double PI = acos(-1.);

int a[N], b[N], tmp[N * 2];
ll ans[N * 2], pos[N * 2], neg[N * 2];
int brev[1 << L];
Cd w[1 << L];

void fft(Cd* a, int lgn, int sgn) {
  int n = 1 << lgn;
  for (int i = 0; i < n; ++i) {
    int rv = brev[i] >> (L - lgn);
    if (i < rv)
      swap(a[i], a[rv]);
  }
  for (int k = L - 1, t = 1; t < n; --k, t <<= 1) {
    for (int i = 0; i < n; i += t << 1) {
      for (int j = 0; j < t; ++j) {
        Cd a0 = a[i + j], a1 = a[i + j + t];
        a[i + j] = (a0 + w[j << k] * a1);
        a[i + j + t] = (a0 - w[j << k] * a1);
      }
    }
  }
  if (sgn == -1) {
    reverse(a + 1, a + n);
    for (int i = 0; i < n; ++i)
      a[i] /= n;
  }
}

void dft(Cd* a, Cd* b, int lgn, int d) {
  int n = 1 << lgn;
  for (int i = 0; i < n; ++i) a[i].imag(b[i].real());
  fft(a, lgn, d);
  b[0] = conj(a[0]);
  for (int i = 1; i < n; ++i) b[i] = conj(a[n - i]);
  for (int i = 0; i < n; ++i) {
    Cd x = a[i], y = b[i];
    a[i] = (x + y) * .5;
    b[i] = (x - y) * Cd(0, -.5);
  }
}

void mult(int* a, int n, int* b, int m, int* c) {
  int l = 0;
  while ((1 << l) <= n + m) ++l;
  static Cd ta[1 << L], tb[1 << L];
  copy(a, a + n + 1, ta);
  fill(ta + n + 1, ta + (1 << l), 0);
  copy(b, b + m + 1, tb);
  fill(tb + m + 1, tb + (1 << l), 0);
  dft(ta, tb, l, 1);
  for (int i = 0; i < (1 << l); ++i)
    ta[i] *= tb[i];
  fft(ta, l, -1);
  for (int i = 0; i <= n + m; ++i)
    c[i] = round(ta[i].real());
}

void fftinit() {
  int l = 1 << L;
  for (int i = 0; i < l; ++i)
    brev[i] = (brev[i >> 1] >> 1) | ((i & 1) << (L - 1));
  for (int i = 0; i < l; ++i)
    w[i] = Cd(cos(2 * PI * i / l), sin(2 * PI * i / l));
}

void ad1(int* a, int k) {
  if (a[k]) {
    a[k] = 0;
    ad1(a, k + 1);
    if (k - 2 >= 0)
      ad1(a, k - 2);
    return;
  }
  if (a[k + 1]) {
    int j = k;
    while (a[j + 1]) {
      a[j + 1] = 0;
      j += 2;
    }
    a[j] = 1;
  } else if (a[k - 1]) {
    a[k - 1] = 0;
    ad1(a, k + 1);
  } else
    a[k] = 1;
}

void sum(int* a, int* b, int sz) {
  static int tm[N * 2];
  fill(tm, tm + sz + 1, 0);
  for (int i = sz; i; --i) {
    int ad = a[i] + b[i];
    while (ad--)
      ad1(tm, i);
  }
  if (tm[0]) {
    tm[0] = 0;
    ad1(tm, 1);
  }
  copy(tm, tm + sz + 1, a);
}

void normalize(ll* a, int sz) {
  static int res[N * 2];

  a[1] += a[0];
  a[0] = 0;
  int cnt = 0;
  for (int i = 1; i <= sz; ++i) while (a[i] >= (1LL << cnt)) ++cnt;
  fill(res, res + sz + 1, 0);
  for (int i = cnt; i >= 0; --i) {
    sum(res, res, sz);
    for (int j = 1; j <= sz; ++j)
      tmp[j] = (a[j] >> i) & 1;
    tmp[0] = 0;
    sum(res, tmp, sz);
  }
  copy(res + 1, res + sz + 1, a + 1);
}

int main() {

  fftinit();

  int t;
  scanf("%d", &t);
  while (t--) {
    int n, m;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) a[i] = (getchar(), getchar()) - '0';
    scanf("%d", &m);
    for (int i = 1; i <= m; ++i) b[i] = (getchar(), getchar()) - '0';
    b[0] = 0;

    int sz = n + m + 10;

    fill(tmp, tmp + sz + 1, 0);
    mult(a, n, b, m, tmp);
    copy(tmp, tmp + sz + 1, ans);

    for (int i = 1; i <= n; i += 2) a[i] = -a[i];
    reverse(b, b + m + 1);
    mult(a, n, b, m, tmp);
    for (int i = 0; i <= n + m; ++i) {
      if (i - m <= -2) {
        ans[m - i - 2] += tmp[i];
      } else if (i - m >= 2) {
        if ((i - m) & 1) tmp[i] = -tmp[i];
        ans[i - m - 2] += tmp[i];
      }
    }

    for (int i = sz - 2; i >= 0; --i) ans[i] -= ans[i + 2];
    ans[1] += ans[0];
    ans[0] = 0;

    fill(pos, pos + sz + 1, 0);
    fill(neg, neg + sz + 1, 0);
    for (int i = 1; i <= sz; ++i)
      if (ans[i] < 0) neg[i] = -ans[i];
      else pos[i] = ans[i];

    normalize(pos, sz);
    normalize(neg, sz);

    for (int i = 1; i <= sz; ++i) ans[i] = pos[i] - neg[i];
    for (int i = sz; i >= 2; --i)
      if (ans[i] > 0 && ans[i - 1] <= 0) {
        --ans[i];
        ++ans[i - 1];
        ++ans[i - 2];
      }
    normalize(ans, sz);
    while (!ans[sz]) --sz;
    printf("%d", sz);
    for (int i = 1; i <= sz; ++i) {
      putchar(' ');
      putchar('0' + ans[i]);
    }
    putchar('\n');
  }

  return 0;
}