#include<set>

#include<map>

#include<stack>

#include<cmath>

#include<queue>

#include<vector>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

typedef long long ll;

using namespace std;

const int maxn =  + ;

const int seed = ;

const ll MOD = ;

const int INF = 0x3f3f3f3f;

int a[maxn], b[maxn], node[maxn];

int lowbit(int x){

    return x&(-x);

}

void update(int x){

    for(int i = x; i < maxn; i += lowbit(i))

        node[i]++;

}

ll query(int x){

    ll ret = ;

    for(int i = x; i > ; i -= lowbit(i))

        ret += node[i];

    return ret;

}

int main(){

    int n, x, y;

    while(~scanf("%d%d%d", &n, &x, &y)){

        ll ans = ;

        memset(node, , sizeof(node));

        for(int i = ; i <= n; i++)

            scanf("%d", &a[i]), b[i] = a[i];

        sort(b + , b + n + );

        for(int i = ; i <= n; i++)

            a[i] = lower_bound(b + , b + n + , a[i]) - b;

        for(int i = n; i >= ; i--){

            ans += query(a[i] - );

            update(a[i]);

        }

        printf("%lld\n", min(x, y) * ans);

    }

    return ;

}