#include <bits/stdc++.h>
using namespace std;
int n, m;
const int maxn = 1e3 + 5;
bitset<500005> dp[1005];
int a[maxn], b[maxn];
vector<int> A[2], B[2];
vector<pair<int, int> > ans;
int main() {
  int T;
  cin >> T;
  while (T--) {
    for (int i = (0); i < (2); ++i) A[i].clear(), B[i].clear();
    scanf("%d", &n);
    int ok = 1;
    dp[0].reset();
    dp[0][0] = 1;
    int s = 0;
    for (int i = (1); i < (n + 1); ++i)
      scanf("%d", &a[i]), s += a[i], dp[i] = (dp[i - 1] | (dp[i - 1] << a[i]));
    if ((s & 1) || !dp[n][s / 2]) ok = 0;
    s /= 2;
    if (ok)
      for (int i = n; i > 0; --i)
        if (dp[i - 1][s])
          A[0].push_back(a[i]);
        else
          A[1].push_back(a[i]), s -= a[i];
    scanf("%d", &m);
    s = 0;
    if (n != m) ok = 0;
    for (int i = (1); i < (m + 1); ++i)
      scanf("%d", &b[i]), s += b[i], dp[i] = (dp[i - 1] | (dp[i - 1] << b[i]));
    if (s & 1 || !dp[m][s / 2]) ok = 0;
    s /= 2;
    if (ok)
      for (int i = m; i > 0; --i)
        if (dp[i - 1][s])
          B[0].push_back(b[i]);
        else
          B[1].push_back(b[i]), s -= b[i];
    if (!ok) {
      puts("No");
      continue;
    }
    for (int i = (0); i < (2); ++i)
      sort(A[i].begin(), A[i].end()), sort(B[i].begin(), B[i].end());
    for (int i = (0); i < (2); ++i) reverse(A[i].begin(), A[i].end());
    if (A[0].size() < A[1].size()) swap(A[0], A[1]);
    if (B[0].size() > B[1].size()) swap(B[0], B[1]);
    int w1 = B[0].size(), w3 = A[1].size(), w2 = A[0].size() - B[0].size();
    ans.clear();
    for (int i = (0); i < (w1); ++i)
      ans.push_back(pair<int, int>(-A[0][i], -B[0][i]));
    for (int i = (0); i < (w3); ++i)
      ans.push_back(pair<int, int>(A[1][i], B[1][i + w2]));
    for (int i = (w1); i < (w1 + w2); ++i)
      ans.push_back(pair<int, int>(-A[0][i], B[1][i - w1]));
    puts("Yes");
    int x = 0, y = 0;
    for (auto p : ans) {
      int dx, dy;
      tie(dx, dy) = p;
      x += dx;
      printf("%d %d\n", x, y);
      y += dy;
      printf("%d %d\n", x, y);
    }
  }
  return 0;
}
