#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 1E5;

void solve() {
    int n, c;
    std::cin >> n >> c;
    
    std::bitset<N + 1> a{}, b{};
    for (int i = 0; i < n; i++) {
        int x;
        std::cin >> x;
        a[x] = b[N - x] = 1;
    }
    
    double ans = -1;
    
    for (int s = 2 * c, z = s; s >= 3; s--) {
        while (z > 0 && (z >= s || !a[z])) {
            z--;
        }
        if (2 * z >= s) {
            a[z] = b[N - z] = 0;
            auto v = a & (s < N ? b >> (N - s) : b << (s - N));
            int x = v._Find_next(s - z - 1);
            int y = s - x;
            if (x < y && y < z) {
                double p = 0.5 * (x + y + z);
                double area = std::sqrt(p * (p - x) * (p - y) * (p - z));
                if (ans < 0 || ans > area) {
                    ans = area;
                }
            }
            a[z] = b[N - z] = 1;
        }
    }
    
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    std::cout << std::fixed << std::setprecision(10);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}