ABC310

n, p, q = map(int, input().split())
d = list(map(int, input().split()))
print(min(p, q+min(d)))

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    
    vector<int> p(n);
    vector<vector<int>> f(n);
    
    rep(i, n) {
        int c;
        cin >> p[i] >> c;
        f[i] = vector<int>(c);
        rep(j, c) cin >> f[i][j];
    }
    
    rep(i, n)rep(j, n) if (i != j) {
        if (p[i] < p[j]) continue;
        bool ok = true;
        for (int e : f[i]) {
            if (find(f[j].begin(), f[j].end(), e) == f[j].end()) ok = false;
        }
        if (!ok) continue;
        if (p[i] == p[j] and f[i] == f[j]) continue;
        puts("Yes");
        return 0;
    }
    
    puts("No");
    
    return 0;
}

// 用 bitset 实现
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    
    vector<int> p(n);
    vector<bitset<101>> f(n);
    
    rep(i, n) {
        int c;
        cin >> p[i] >> c;
        rep(j, c) {
            int e;
            cin >> e;
            f[i][e] = 1;
        }
    }
    
    rep(i, n)rep(j, n) if (i != j) {
        if (p[i] < p[j]) continue;
        if ((f[i]&f[j]) != f[i]) continue;
        if (p[i] == p[j] and f[i] == f[j]) continue;
        puts("Yes");
        return 0;
    }
    
    puts("No");
    
    return 0;
}

n = int(input())

st = set()
for _ in range(n):
    s = input()
    st.add(min(s, s[::-1]))

print(len(st))