#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
vector<char*> tokenizer(const char* args) {
  char* token = new char[111];
  strcpy(token, args);
  token = strtok(token, ", ");
  vector<char*> v({token});
  while (token = strtok(NULL, ", ")) v.push_back(token);
  return reverse(v.begin(), v.end()), v;
}
void debugg(vector<char*> args) { cerr << "\b\b "; }
template <typename Head, typename... Tail>
void debugg(vector<char*> args, Head H, Tail... T) {
  debug() << " [" << args.back() << ": " << H << "] ";
  args.pop_back();
  debugg(args, T...);
}
long long mod = 1e9 + 7;
const int MX = 0x3f3f3f3f;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long d, n, m, i, j, cnt, k, temp;
  long long ans = 0;
  cin >> n >> d >> m;
  vector<int> a(n);
  for (i = 0; i <= n - 1; i++) cin >> a[i];
  sort((a).begin(), (a).end());
  vector<long long> pre(n + 1);
  pre[0] = 0;
  for (i = 0; i <= n - 1; i++) pre[i + 1] = pre[i] + a[i];
  for (k = 0; k <= n - 1; k++) {
    if (a[k] > m) break;
  }
  {};
  for (cnt = 0; cnt <= n - k; cnt++) {
    temp = max((cnt - 1) * (d) - (n - k - cnt), 1ll * 0);
    {};
    if (temp > k) break;
    ans = max(ans, pre[n] - pre[n - cnt] + pre[k] - pre[temp]);
  }
  cout << ans;
  return 0;
}
