#include <bits/stdc++.h>
using namespace std;
int main(int argc, char* argv[]) {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> diamonds;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    diamonds.push_back(a);
  }
  if (n % 2 == 0) {
    cout << 0;
    return 0;
  }
  int limit = 0;
  int chain = 0;
  for (int i = 0; i < n; i++) {
    if (diamonds[i] != 0) {
      chain++;
    } else {
      if (chain % 2 == 0) {
        cout << 0;
        return 0;
      }
      chain = 0;
    }
    if (i % 2 == 0) {
      if ((limit == 0) || (diamonds[i] < limit)) {
        limit = diamonds[i];
      }
    }
  }
  int count = m / (n / 2 + 1);
  long long win = min((long long)count * k, (long long)limit);
  cout << win;
  return 0;
}
