#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
using namespace std;
const int maxn = 1e5 + 10;
const int mod = 998244353;

void solve(){
    int n, m;
    cin >> n >> m;
    multiset<int> a, b;
    for (int i = 0; i < n;i++){
        int u;
        cin >> u;
        a.insert(u);
    }
    for (int i = 0; i < m;i++){
        int u;
        cin >> u;
        b.insert(u);
    }
    map<int, int> mp;
    for(auto p:a){
        if(b.count(p))
            mp[p] = min(b.count(p), a.count(p));
    }
    for(auto [v,cnt]:mp){
        for (int i = 0; i < cnt;i++){
            a.erase(a.find(v));
            b.erase(b.find(v));
        }
    }
    int mi = *b.begin();
//    cout << a.size() << " SS " << b.size() << "\n";
    int flag = 1;
    vector<int> ans;
    for (int i = 0; i < n - m;i++){
        if(b.empty()){
            int u = *(a.begin());
            if(u>=mi)
                flag = 0;
            ans.pb(u);
            a.erase(a.find(u));
            a.insert(u + 1);
            int k = *a.begin();
            a.erase(a.find(k));
        }
        else {
            int u = *(a.rbegin());
            ans.pb(u);
            a.erase(a.find(u));
            if(b.count(u+1))
                b.erase(b.find(u + 1));
            else
                a.insert(u + 1);
            int k = *a.begin();
            a.erase(a.find(k));
        }
    }
//    cout << a.size() << " " << b.size() << "\n";
    if(b.size()||a.size()||(flag==0)){
        cout <<-1<<"\n";
    }
    else {
        cout << ans.size() <<"\n";
        assert((int)ans.size()==n-m);
        for (int i = 0; i < n - m;i++){
            cout << ans[i];
            if(i!=n-m-1)
            cout << " ";
        }
            cout << '\n';
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}