#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[200005];
int main() {
  cin >> n >> m >> k;
  long long max1 = -1, max2 = -1;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] > max1) {
      max2 = max1;
      max1 = a[i];
    } else if (a[i] > max2)
      max2 = a[i];
  }
  long long y = k * max1 + max2;
  int d = m / (k + 1), t = m % (k + 1);
  long long ans = y * d + t * max1;
  cout << ans << endl;
  return 0;
}
