#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int MOD = 998244353;

void solve()
{
    int n, k;
    cin >> n >> k;

    vector<int> a(k);
    for (auto &c : a)
        cin >> c;

    if (!a.empty() && a.front() == 1) {
        cout << n << ' ' << k - 1 << '\n';
        for (int i = 1; i < k; ++i)
            cout << a[i] << " \n"[i == k - 1];
    }
    else {
        cout << n << ' ' << k + 1 << '\n';
        cout << "1 ";
        for (const auto &c : a)
            cout << c << ' ';
        cout << '\n';
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}