#include <bits/stdc++.h>

using namespace std;

void fn(int n, vector<int>& b) {
    n += 2;
    sort(b.begin(), b.end());

    auto s = accumulate(b.begin(), b.end() - 2, (long long) 0);
    if (s == b[n - 2] || s == b[n - 1]) {
        for (auto i = 0; i < n - 2; ++i)
            printf("%d ", b[i]);
        printf("\n");
        return;
    }

    s += b[n - 2];
    for (auto i = 0; i < n - 1; ++i) {
        if (s - b[i] == b[n - 1]) {
            for (auto j = 0; j < n - 1; ++j)
                if(j != i)
                    printf("%d ", b[j]);
            printf("\n");
            return;
        }
    }

    printf("-1\n");
}

int main() {
    int t;
    cin >> t;

    for (auto i = 0; i < t; ++i) {
        int n;
        cin >> n;

        vector<int> b(n + 2);
        for (auto k = 0; k < n + 2; ++k)
            cin >> b[k];
        fn(n, b);
    }
}