#include <iostream>
using namespace std;
int n, beginLevel, maxLevel, c, dp[1005], ans;
int main() {
	cin >> n >> beginLevel >> maxLevel;
	for (int i = 1; i <= n; i++) {
		cin >> c;
		for (int j = maxLevel; j >= 0; j--) {
			if (j - c >= 0 && j - c <= maxLevel && !dp[j]) dp[j] = 1;
			if (j + c >= 0 && j + c <= maxLevel && !dp[j]) dp[j] = 1;
		}
	}
	for (int i = maxLevel; i > 0; i--) {
		if (dp[i]) {
			ans = i;
			break;
		}
	}
	cout << ans << endl;
	return 0;
}