#include <bits/stdc++.h>
#define ll long long
using namespace std ;
 int n , m ;
long long x;

    int main() {
        int t ;
        scanf("%d" ,&t) ;
         while (t--) {
        scanf("%d" ,&n) ;
        vector<long long > vec ;
        long long su = 0 ;
        for (int i = 0 ; i < n  + 2 ; i++ ){
            scanf("%I64d" , &x);
            vec.push_back(x) ;
            su+= vec[i] ;
         }

    sort (vec.begin () , vec.end () );
    int k = n + 1;
    bool ok = false;
     su -= vec[k] ;
    // try sum is k "
  int e =  -1 ;
    for (int i = 0 ; i <= n ; i ++ ) {
        if (su - vec[i] == vec[k] ) {
           e = i ;
            ok = true;
            break ;
        }
    }
     if (ok ){
        for (int i = 0 ; i <=n ; i++) {
           if (i != e )printf ("%I64d " , vec[i] ) ;

        }
        printf("\n");
        continue ;
    }

    ok = (su - vec[k-1] == vec[k-1])    ;
      if (ok ){
        for (int i = 0 ; i <n ; i++) {
           printf ("%I64d " , vec[i] ) ;

        }
        printf("\n");
    }else printf("-1\n");

    }
    }




