#include <bits/stdc++.h>
using namespace std;
long long a[20000], ans, t, ans2;
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  if (n % 2 == 0) return 0 * bool(cout << 0 << endl);
  for (int i = 0; i < n; i++) cin >> a[i];
  t = m / ((n + 1) / 2);
  k *= t;
  ans = min(a[0], a[n - 1]);
  for (int i = 0; i < n; i += 2) ans = min(ans, a[i]);
  ans = min(ans, k);
  cout << ans << endl;
}
