#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const long long int MOD1 = 1e9 + 7;
const long long int MAX5 = 1e5;
const long long int MAX6 = 1e6;
const long long int MAX7 = 1e7;
const long long int MAX8 = 1e8;
const long long int MAX9 = 1e9;
const long long int MAX10 = 1e10;
const long long int MAXX = 1e18;
long long int po(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    res = res * x;
    x = x * x;
    y >>= 1;
  }
  return res;
}
long long int gcd(int a, int b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  return gcd(a % b, b);
}
int foo(int x, int n) {
  if (x == 1) return n;
  return x - 1;
}
void solve() {
  int n;
  cin >> n;
  vector<int> a(n + 1), b(n + 1), c(n + 1), p(n + 1);
  for (int ii = 0; ii < n; ii++) cin >> a[ii + 1];
  for (int ii = 0; ii < n; ii++) cin >> b[ii + 1];
  for (int ii = 0; ii < n; ii++) cin >> c[ii + 1];
  p[1] = a[1];
  for (int ii = 2; ii < n; ii++) {
    if (a[ii] == p[foo(ii, n)]) {
      p[ii] = b[ii];
    } else
      p[ii] = a[ii];
  }
  vector<int> z;
  z.push_back(a[n]);
  z.push_back(b[n]);
  z.push_back(c[n]);
  for (int i = 0; i < 3; i++) {
    if (z[i] == p[1] || z[i] == p[n - 1]) {
      z[i] = -1;
    }
  }
  for (int ii = 0; ii < 3; ii++) {
    if (z[ii] != -1) {
      p[n] = z[ii];
    }
  }
  for (int ii = 1; ii < n + 1; ii++) cout << p[ii] << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int tttt;
  cin >> tttt;
  for (int TTTT = 1; TTTT <= tttt; TTTT++) {
    solve();
    cout << "\n";
    ;
  }
}
