#include <bits/stdc++.h>
using namespace std;
 
// shortcuts
#define M 1000000007
#define endl "\n"
#define ll long long
 
// functions
ll power(ll a , ll b)
{
    ll res = 1;
    while(b)
    {
        if(b%2 == 0)
        { a = (a*a)%M; b/=2; }
        else 
        { res = (res*a)%M; b-=1; }
    }
    return res;
}
ll inv(ll a , ll mod)
{
    ll ans = power(a , mod-2); return ans; 
}
int bit_count(ll n)
{
    int cnt = 0; while (n) {cnt++; n /= 2;}
    return cnt;
}
bool is_prime(ll n)
{
    if(n <= 1) return false;
    for(ll i = 2;i*i<=n;i++) if((n%i) == 0) return false;
    return true;
}
void seive_func(vector<bool> vt , ll n)
{
    vt[0] = false , vt[1] = false;
    for(ll i = 2;i*i<=n;i++)
    {
        if(vt[i]) { for(ll j = i*i;j<=n;j+=i)  {vt[j] = false;} }
    }
}
 
void bfs(vector<vector<ll>> &adj , ll src , ll n)
{
    queue<ll> q;
    bool visited[n+1] = {false};
    visited[src] = true;
    cout << src << " ";
    q.push(src);
 
    while(q.empty() == false) 
    {
        ll p = q.front(); q.pop();
        for(auto &i : adj[p])
        {
            if(visited[i] == false)
            { q.push(i); cout << i << " "; visited[i] = true; }
        }
    }
}
 
// void dfs(vector<vector<ll>> &adj , ll source)
// {
//     if(visited[source] == true) return;
//     cout << source << " ";
//     visited[source] = true;
//     for(auto &i : adj[source])
//     {
//         if(visited[i] == false) dfs(adj, i);
//     }
// }
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
void solve()
{ 
    ll n,c,d;
    cin>>n>>c>>d;
 
    vector<ll> v(n);
 
    for(int i=0;i<n;i++)  cin>>v[i];
 
    sort(v.begin(),v.end());
   
 
    ll k=1,x=0;
    ll ans=INT_MAX;
    if(v[0]!=1)  ans= n*c+d;
 
    for(int i=0;i<n;i++){
        if(v[i]==k){
            k++;
            ans=min(ans,x+(n-i-1)*c);
        }
        else if(v[i]>k){
           ll j=(v[i]-k)*d;
           x+=j;
           k=v[i--];     
        }
        else x+=c;
    }
 
    cout<<ans<<endl;
 
}
 
 
 
int main()
{
    
 
    ll t;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}