import java.util.Scanner;

public class Cf1398a {
    private static void solve(int[] as) {
        for (int i = 0; i < as.length - 2; i++) {
            for (int j = i + 1; j < as.length - 1; j++) {
                for (int k = j + 1; k < as.length; k++) {
                    if (as[i] + as[j] <= as[k]) {
                        System.out.println(as[i] + " " + as[j] + " " + as[k]);
                        return;
                    }
                }
            }
        }
        System.out.println("-1");
    }

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        for (int test = input.nextInt(); test > 0; test--) {
            int n = input.nextInt();
            int[] as = new int[n];
            for (int i = 0; i < n; i++) {
                as[i] = input.nextInt();
            }
            solve(as);
        }
    }
}
