#include <bits/stdc++.h>

using namespace std;
#define int long long
const int N = 100010;

int n, t, m, ans = 1e17, a[N];

void dfs(int pos, int sum, int money) {
	if (pos > n) {
		ans = min(ans, money);
		return;
	}
	if (sum + a[pos] > t) dfs(pos + 1, a[pos], money + m);
	else {
		dfs(pos + 1, sum + a[pos], money);
		dfs(pos + 1, a[pos], money + m);
	}
}

signed main() {
	cin >> n >> t >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];
	dfs(1, 0, m);
	cout << ans << endl;
	return 0;
}