#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency(int n, int c, int d){

    a.push_back(0);
    n = a.size();  

    sort(begin(a), end(a));

    int cost = 0;

    vector<int> b;
    for(int i=0; i<n; ){
        b.push_back(a[i]);

        int j = i+1;
        while(j<n && a[j] == a[i]) j++;
        cost += (j-i-1)*c;
        i = j;
    }


    n = b.size();
    vector<int> diff(n-1);

    for(int i=1; i<n; i++){
        diff[i-1] = b[i] - b[i-1] - 1;
    }

    for(int i=1; i<n-1; i++){
        diff[i] += diff[i-1];
    }

    int mini = c*(n-1) + d*1;

    for(int i=1; i<n; i++){
        int cost = c*((n-1)-i) + d*diff[i-1];
        mini = min(mini, cost);
    }

    return mini+cost;
}















int practice(int n, int c, int d){


    return 0;
}





void solve() {
    
    int n, c, d;
    cin>> n >> c >> d;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n, c, d) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}