#include <bits/stdc++.h>
using namespace std;
int N[10000];
int sum = 0;
int flag = 100000;
void check(int n) {
  for (int i = 0; i < n; i = i + 2) {
    flag = min(N[i], flag);
  }
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    cin >> N[i];
  }
  if (n % 2 != 0 && (n + 1) / 2 <= m && k != 0) {
    check(n);
    int tem = m / ((n + 1) / 2);
    if (k >= 100000 || tem >= 100000)
      sum = flag;
    else {
      sum = min(flag, (k % 100000) * (tem % 100000));
    }
  }
  cout << sum << endl;
  return 0;
}
