#include <bits/stdc++.h>

using namespace std;

const int kMaxN = 110;

int n, p, q, d[kMaxN], sum[kMaxN];

int main() {
  cin >> n >> p >> q;
	for (int i = 1; i <= n; ++ i) {
		cin >> d[i];
	}
	sort(d + 1, d + n + 1);
	int ans = INT_MAX; 
	for (int i = 1; i <= n; ++ i) {
		ans = min(ans, d[i] + (p - q <= 0? 0 : p - q));
	}
	cout << min(p, ans) << endl;
	return 0;
}