#include <bits/stdc++.h>
using namespace std;
vector<int> l[100001];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  long long int a[n];
  long long int sum = 0, max_element = 0, second = 0;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long int count = 0;
  max_element = a[n - 1];
  for (int i = n - 1; i >= 0; i--) {
    if (max_element == a[i])
      count++;
    else {
      second = a[i];
      break;
    }
  }
  long long int d;
  if (count >= 2) {
    cout << (m * max_element);
    return 0;
  } else {
    d = m / (k + 1);
    sum = d * (max_element * k + second);
    sum = sum + (m % (k + 1)) * max_element;
  }
  cout << sum;
}
