#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define NL std::cout << '\n'

using lnt = long long;
lnt linf = 1ll << 62;
int inf = 0x3f3f3f3f;

void solve() {
  auto fail = []() {
    std::cout << -1; NL;
  };
  int n, m; std::cin >> n >> m;
  std::vector<int> v1(n), v2(m);
  std::map<int, int> mp;
  for (auto &x : v1) { std::cin >> x; }
  for (auto &x : v2) { std::cin >> x; mp[x]++; }
  std::sort(v1.rbegin(), v1.rend());
  std::sort(v2.rbegin(), v2.rend());
  std::vector<int> ret;
  int o = 0;
  for (int i = 0, j = 0; i < m && j < n; ++i, ++j) {
    if (v1[j] > v2[i]) {
      return fail();
    }
    if (v1[j] == v2[i]) { continue; }
    for (int x = v1[j]; x < v2[i]; ++x) {
      ret.emplace_back(x);
    }
    o += (v2[i] - v1[j]);
  }
  if (o > n-m) { return fail(); }
  std::priority_queue<int, std::vector<int>, std::greater<>> q;
  for (int i = m + o; i < n; ++i) { q.emplace(v1[i]); }
  std::vector<int> ret2;
  while (!q.empty()) {
    int x = q.top(); q.pop();
    if (x+1 > v2.back()) { return fail(); }
    ret2.emplace_back(x);
    q.emplace(x+1); q.pop();
  }
  std::cout << ret.size() + ret2.size(); NL;
  for (auto x : ret2) {
    std::cout << x << " ";
  }
  for (auto x : ret) {
    std::cout << x << " ";
  } NL;
}

signed main() {
  std::ios::sync_with_stdio(false); std::cin.tie(nullptr);
  int t = 1;
  std::cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}