#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define nl "\n"
#define vi vector<int>
#define vvi vector <vector <int>>
#define vb vector <bool>
#define vs vector<string>
#define pii pair<int,int>
#define vpii vector <pii>
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define all(a) a.begin(), a.end()
#define allr(vec) vec.rbegin(), vec.rend()
#define mod1 1000000007
#define mod2 998244353
#define sahi(vec) sort(vec.begin(),vec.end())
#define ulta(vec) sort(vec.begin(),vec.end(),greater<typename decltype(vec)::value_type>())
#define thek(vec) is_sorted(all(vec))
#define fori(a,b) for(int i=a;i<b;i++)
#define forr(a,b) for(int r=a;r>=b;r--)
#define gcd(a,b) __gcd(a,b)
#define popcount(a) __builtin_popcountll(a)
int lcm(int a,int b) {
    return a/gcd(a,b)*b;
}
/*
Problem: 


Observation: 


*/
void solve(){
    int n,k;
    cin >> n >> k;
    vi a(n);
    int pro=1;
    fori(0,n){
        cin >> a[i];
    }
    int mn=LLONG_MAX;
    for(int i=0;i<n;i++){
        int cur=1;
        for(int j=0;j<n;j++){
            if(i==j){
                cur*=(a[j]-k);
            }else{
                cur*=a[j];
            }
        }
        mn=min(cur,mn);
    }
    cout << mn << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}