#include <bits/stdc++.h>
int n, m, k;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  int v;
  int mx1 = 0, mx2 = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &v);
    if (v > mx1) {
      mx2 = mx1;
      mx1 = v;
    } else if (v > mx2)
      mx2 = v;
  }
  printf("%lld\n", (m / (k + 1)) * ((long long)k * mx1 + mx2) +
                       (long long)mx1 * (m % (k + 1)));
  return 0;
}
