Problem: Phoenix loves beautiful arrays. An array is beautiful if all its subarrays of length k have the same sum. A subarray of an array is any sequence of consecutive elements.

Phoenix currently has an array a of length n. He wants to insert some number of integers, possibly zero, into his array such that it becomes beautiful. The inserted integers must be between 1 and n inclusive. Integers may be inserted anywhere (even before the first or after the last element), and he is not trying to minimize the number of inserted integers.

Input

The input consists of multiple test cases. The first line contains an integer t (1 ≤ t ≤ 50) — the number of test cases.

The first line of each test case contains two integers n and k (1 ≤ k ≤ n ≤ 100).

The second line of each test case contains n space-separated integers (1 ≤ a_i ≤ n) — the array that Phoenix currently has. This array may or may not be already beautiful.

Output

For each test case, if it is impossible to create a beautiful array, print -1. Otherwise, print two lines.

The first line should contain the length of the beautiful array m (n ≤ m ≤ 10^4). You don't need to minimize m.

The second line should contain m space-separated integers (1 ≤ b_i ≤ n) — a beautiful array that Phoenix can obtain after inserting some, possibly zero, integers into his array a. You may print integers that weren't originally in array a.

If there are multiple solutions, print any. It's guaranteed that if we can make array a beautiful, we can always make it with resulting length no more than 10^4.

Example

Input


4
4 2
1 2 2 1
4 3
1 2 2 1
3 2
1 2 3
4 4
4 3 4 2


Output


5
1 2 1 2 1
4
1 2 2 1
-1
7
4 3 2 1 4 3 2

Note

In the first test case, we can make array a beautiful by inserting the integer 1 at index 3 (in between the two existing 2s). Now, all subarrays of length k=2 have the same sum 3. There exists many other possible solutions, for example: 

  * 2, 1, 2, 1, 2, 1 
  * 1, 2, 1, 2, 1, 2 



In the second test case, the array is already beautiful: all subarrays of length k=3 have the same sum 5.

In the third test case, it can be shown that we cannot insert numbers to make array a beautiful.

In the fourth test case, the array b shown is beautiful and all subarrays of length k=4 have the same sum 10. There exist other solutions also.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int64_t X = 1e9 + 7;
const int64_t inf = 1e18;
void google(int64_t i) { cout << "Case #" << i << ": "; }
void prec(double n, int64_t d) {
  cout << fixed << setprecision(d) << n << "\n";
}
int64_t prime[1000001];
void sieve(int64_t n) {
  for (int64_t i = 0; (0 <= n + 1) ? (i < n + 1) : (i >= n + 1);
       (0 <= n + 1) ? (i++) : (i--))
    prime[i] = 1;
  for (int64_t i = 2; i * i <= n; i++) {
    if (prime[i] != 1) continue;
    for (int64_t j = i * i; j <= n; j = j + i)
      if (prime[j] == 1) prime[j] = i;
  }
}
int64_t gcd(int64_t a, int64_t b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int64_t bin(int64_t a, int64_t n, int64_t m) {
  int64_t res = 1;
  while (n) {
    if (n % 2) {
      res = (res * a) % m;
      n--;
    }
    a = (a * a) % m;
    n /= 2;
  }
  return res;
}
void dijktra(vector<pair<int64_t, int64_t>> g[], int64_t n) {
  priority_queue<pair<int64_t, int64_t>, vector<pair<int64_t, int64_t>>,
                 greater<pair<int64_t, int64_t>>>
      pq;
  vector<int64_t> dist(n, inf);
  dist[0] = 0;
  int64_t parent[n];
  memset(parent, -1, sizeof(parent));
  pq.push({0, 0});
  while (!pq.empty()) {
    pair<int64_t, int64_t> x = pq.top();
    pq.pop();
    for (int64_t i = 0; (0 <= (int64_t)g[x.second].size())
                            ? (i < (int64_t)g[x.second].size())
                            : (i >= (int64_t)g[x.second].size());
         (0 <= (int64_t)g[x.second].size()) ? (i++) : (i--)) {
      pair<int64_t, int64_t> k = g[x.second][i];
      if (dist[x.second] + k.first < dist[k.second]) {
        dist[k.second] = dist[x.second] + k.first;
        parent[k.second] = x.second;
        pq.push({dist[k.second], k.second});
      }
    }
  }
}
void bfs(int64_t s, vector<int64_t> g[], int64_t n) {
  bool vis[n];
  for (int64_t i = 0; (0 <= n) ? (i < n) : (i >= n); (0 <= n) ? (i++) : (i--))
    vis[i] = false;
  vis[s] = true;
  deque<int64_t> q;
  q.push_back(s);
  while (!q.empty()) {
    s = q.front();
    q.pop_front();
    for (int64_t i = 0; i < (int64_t)g[s].size(); i++) {
      if (!vis[g[s][i]]) {
        vis[g[s][i]] = true;
        q.push_back(g[s][i]);
      }
    }
  }
}
void dfs(int64_t u, vector<int64_t> g[], bool *vis) {
  vis[u] = true;
  for (int64_t i = 0; i < (int64_t)g[u].size(); i++)
    if (!vis[g[u][i]]) dfs(g[u][i], g, vis);
}
void create_w(vector<pair<int64_t, int64_t>> *g, int64_t m) {
  for (int64_t i = 0; (0 <= m) ? (i < m) : (i >= m); (0 <= m) ? (i++) : (i--)) {
    int64_t u, vector, w;
    cin >> u >> vector >> w;
    g[u - 1].push_back({w, vector - 1});
    g[vector - 1].push_back({w, u - 1});
  }
}
void create(vector<int64_t> *g, int64_t m) {
  for (int64_t i = 0; (0 <= m) ? (i < m) : (i >= m); (0 <= m) ? (i++) : (i--)) {
    int64_t u, vector;
    cin >> u >> vector;
    g[u - 1].push_back(vector - 1);
    g[vector - 1].push_back(u - 1);
  }
}
void contest(int64_t t) {
  int64_t n, k;
  cin >> n >> k;
  map<int64_t, int64_t> a;
  for (int64_t i = 0; (0 <= n) ? (i < n) : (i >= n); (0 <= n) ? (i++) : (i--)) {
    int64_t x;
    cin >> x;
    a[x]++;
  }
  if (a.size() > k) {
    cout << "-1"
         << "\n";
    return;
  }
  if (a.size() < k) {
    int64_t cnt = k - a.size();
    for (int64_t i = 1; (1 <= n + 1) ? (i < n + 1) : (i >= n + 1);
         (1 <= n + 1) ? (i++) : (i--)) {
      if (cnt == 0) break;
      if (a.find(i) == a.end()) {
        cnt--;
        a[i] = 1;
      }
    }
  }
  cout << n * k << "\n";
  for (int64_t i = 0; (0 <= n) ? (i < n) : (i >= n); (0 <= n) ? (i++) : (i--)) {
    for (auto j : a) cout << j.first << " ";
  }
  cout << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int64_t T = 1;
  cin >> T;
  for (int64_t t = 0; (0 <= T) ? (t < T) : (t >= T); (0 <= T) ? (t++) : (t--)) {
    contest(t);
  }
  return 0;
}