#include <bits/stdc++.h>
using namespace std;
int num[10005];
int main() {
  int n, m, k;
  while (~scanf("%d%d%d", &n, &m, &k)) {
    for (int i = 0; i < n; i++) scanf("%d", &num[i]);
    if (n % 2 == 0 || m < (n / 2 + 1)) {
      printf("0\n");
      continue;
    }
    int min = 100005;
    long long sum = k;
    for (int i = 0; i < n; i += 2)
      if (min > num[i]) min = num[i];
    sum *= (m / (n / 2 + 1));
    if (sum < (long long)min) min = (int)sum;
    printf("%d\n", min);
  }
}
