import java.util.*;
import java.io.*; 
import java.text.*;
//Solution Credits: Taranpreet Singh
public class Main{
    //SOLUTION BEGIN
    void solve(int TC) throws Exception{
        //Checking Runtime
        int n = ni();long X = nl(), Y = nl();
        Pair[] p = new Pair[n+1];long[] a = new long[n+1];
        for(int i = 1; i<= n; i++){a[i] = nl(); p[i] = new Pair(i, a[i]);}
        Arrays.sort(p, 1, n+1);
        int p1= -1, p2 = -1, p3=-1;
        Frac ans = new Frac(2, 1);
        for(int i = 0; i< n; i++){
            for(int j = i+1; j< n; j++){
                long H = Y*(a[i]*a[i]+a[j]*a[j]) - 2*a[i]*a[j]*X;
                int l = 0, r = n+1;
                while(r-l>1){
                    int mid = (l+r)/2;
                    if(p[mid].val*p[mid].val*Y <= H)l = mid;
                    else r = mid;
                }
                while(l>=1 && (p[l].x==i || p[l].x==j))l--;
                if(l==0)continue;
                if(p[l].val <= Math.abs(a[i]-a[j]))continue;
                Frac cans = new Frac(a[i]*a[i]+a[j]*a[j]-p[l].val*p[l].val, 2*a[i]*a[j]);
                if(cans.compareTo(ans)<0){
                    ans = cans;
                    p1 = p[l].x;
                    p2 = i;
                    p3 = j;
                }
            }
        }
        if(ans.x==2)pn(-1);
        else pn(p1+" " +p2+" "+p3);
    }
    class Pair implements Comparable<Pair>{
        int x;
        long val;
        public Pair(int ind, long value){
            x = ind;val = value;
        }
        public int compareTo(Pair p){
            return Long.compare(val, p.val);
        }
    }
    class Frac implements Comparable<Frac>{
        long x, y;
        public Frac(long x, long y){
            this.x = x;this.y=y;
        }
        public int compareTo(Frac f){
            return Long.compare(x*f.y,y*f.x);
        }
    }
    //SOLUTION END
    long mod = (long)998244353, IINF = (long)1e17;
    final int MAX = (int)1e3+1, INF = (int)2e9, root = 3;
    DecimalFormat df = new DecimalFormat("0.0000000000000");
    double PI = 3.1415926535897932384626433832792884197169399375105820974944, eps = 1e-8;
    static boolean multipleTC = true, memory = false;
    FastReader in;PrintWriter out;
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        int T = (multipleTC)?ni():1;
        //Solution Credits: Taranpreet Singh
        for(int i = 1; i<= T; i++)solve(i);
        out.flush();
        out.close();
    }
    public static void main(String[] args) throws Exception{
        if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
        else new Main().run();
    }
    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

    class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine(){
            String str = "";
            try{    
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }   
            return str;
        }
    }
}