#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main() {
    int T;
    cin >> T;
 
    while (T--) {
        int N, X, Y;
        cin >> N >> X >> Y;
 
        vector<int> A(N);
        for (int i = 0; i < N; ++i) {
            cin >> A[i];
        }
 
        int cost = 0;
        if (X > Y) {
            cost = N * Y;
        } else {
            int max_difficulty = *max_element(A.begin(), A.end());
            cost = (N - 1) * X + Y;
        }
 
        cout << cost << endl;
    }
 
    return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogICAgaW50IFQ7CiAgICBjaW4gPj4gVDsKICAgIAogICAgd2hpbGUgKFQtLSkgewogICAgICAgIGludCBOLCBYLCBZOwogICAgICAgIGNpbiA+PiBOID4+IFggPj4gWTsKICAgICAgICAKICAgICAgICB2ZWN0b3I8aW50PiBBKE4pOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgTjsgKytpKSB7CiAgICAgICAgICAgIGNpbiA+PiBBW2ldOwogICAgICAgIH0KICAgICAgICAKICAgICAgICBpbnQgY29zdCA9IDA7CiAgICAgICAgaWYgKFggPiBZKSB7CiAgICAgICAgICAgIGNvc3QgPSBOICogWTsKICAgICAgICB9IGVsc2UgewogICAgICAgICAgICBpbnQgbWF4X2RpZmZpY3VsdHkgPSAqbWF4X2VsZW1lbnQoQS5iZWdpbigpLCBBLmVuZCgpKTsKICAgICAgICAgICAgY29zdCA9IChOIC0gMSkgKiBYICsgWTsKICAgICAgICB9CiAgICAgICAgCiAgICAgICAgY291dCA8PCBjb3N0IDw8IGVuZGw7CiAgICB9CiAgICAKICAgIHJldHVybiAwOwp9Cg==

Mwo0IDUgMzAKNCA1IDIgMwo0IDUgMzAKNCA3IDIgMwo1IDMgMTAwCjExIDIzIDM1IDQ3IDU5

3
4 5 30
4 5 2 3
4 5 30
4 7 2 3
5 3 100
11 23 35 47 59