#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long double PI = 4 * atan((long double)1);
const long long INF = 1e18;
const long long NINF = -1e18;
long long get_hash(string s) {
  long long N = 1000001;
  long long base[N], A = 11, MD = 1110111110111;
  base[0] = 1;
  for (long long i = (1); i < (N); ++i) base[i] = (base[i - 1] * A) % MD;
  long long hs = 0;
  for (long long i = (0); i < (s.size()); ++i) {
    hs += (s[i] * base[i]);
    hs %= MD;
  }
  return hs;
}
long long power(long long a, long long n) {
  long long res = 1;
  while (n) {
    if (n % 2) res *= a;
    a *= a;
    n /= 2;
  }
  return res;
}
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) long long idx,
               __attribute__((unused)) long long LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, long long idx, long long LINE_NUM, Head H,
               Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k, l;
  cin >> n >> k >> l;
  long long a[n * k];
  for (long long i = (0); i < (n * k); ++i) cin >> a[i];
  sort(a, a + n * k);
  long long lo = a[0], hi = a[0] + l;
  long long j = -1;
  for (long long i = (0); i < (k * n); ++i) {
    if (a[i] <= hi)
      continue;
    else {
      j = i;
      break;
    }
  }
  if (j < n && j != -1) {
    cout << 0;
    return 0;
  }
  long long ans = 0;
  if (j == -1) {
    for (long long i = 0; i < k * n; i += k) ans += a[i];
  } else {
    long long v = 0;
    for (long long i = 0; i < n; i++) {
      ans += a[v++];
      for (long long h = 0; h < k - 1; h++) {
        if (j - v > n - i - 1)
          v++;
        else
          break;
      }
    }
  }
  cout << ans;
  return 0;
}

### Prompt

In CPP, your task is to solve the following problem:

You have m = n·k wooden staves. The i-th stave has length ai. You have to assemble n barrels consisting of k staves each, you can use any k staves to construct a barrel. Each stave must belong to exactly one barrel.

Let volume vj of barrel j be equal to the length of the minimal stave in it.

<image>

You want to assemble exactly n barrels with the maximal total sum of volumes. But you have to make them equal enough, so a difference between volumes of any pair of the resulting barrels must not exceed l, i.e. |vx - vy| ≤ l for any 1 ≤ x ≤ n and 1 ≤ y ≤ n.

Print maximal total sum of volumes of equal enough barrels or 0 if it's impossible to satisfy the condition above.

Input

The first line contains three space-separated integers n, k and l (1 ≤ n, k ≤ 105, 1 ≤ n·k ≤ 105, 0 ≤ l ≤ 109).

The second line contains m = n·k space-separated integers a1, a2, ..., am (1 ≤ ai ≤ 109) — lengths of staves.

Output

Print single integer — maximal total sum of the volumes of barrels or 0 if it's impossible to construct exactly n barrels satisfying the condition |vx - vy| ≤ l for any 1 ≤ x ≤ n and 1 ≤ y ≤ n.

Examples

Input

4 2 1
2 2 1 2 3 2 2 3


Output

7


Input

2 1 0
10 10


Output

20


Input

1 2 1
5 2


Output

2


Input

3 2 1
1 2 3 4 5 6


Output

0

Note

In the first example you can form the following barrels: [1, 2], [2, 2], [2, 3], [2, 3].

In the second example you can form the following barrels: [10], [10].

In the third example you can form the following barrels: [2, 5].

In the fourth example difference between volumes of barrels in any partition is at least 2 so it is impossible to make barrels equal enough.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long double PI = 4 * atan((long double)1);
const long long INF = 1e18;
const long long NINF = -1e18;
long long get_hash(string s) {
  long long N = 1000001;
  long long base[N], A = 11, MD = 1110111110111;
  base[0] = 1;
  for (long long i = (1); i < (N); ++i) base[i] = (base[i - 1] * A) % MD;
  long long hs = 0;
  for (long long i = (0); i < (s.size()); ++i) {
    hs += (s[i] * base[i]);
    hs %= MD;
  }
  return hs;
}
long long power(long long a, long long n) {
  long long res = 1;
  while (n) {
    if (n % 2) res *= a;
    a *= a;
    n /= 2;
  }
  return res;
}
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) long long idx,
               __attribute__((unused)) long long LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, long long idx, long long LINE_NUM, Head H,
               Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k, l;
  cin >> n >> k >> l;
  long long a[n * k];
  for (long long i = (0); i < (n * k); ++i) cin >> a[i];
  sort(a, a + n * k);
  long long lo = a[0], hi = a[0] + l;
  long long j = -1;
  for (long long i = (0); i < (k * n); ++i) {
    if (a[i] <= hi)
      continue;
    else {
      j = i;
      break;
    }
  }
  if (j < n && j != -1) {
    cout << 0;
    return 0;
  }
  long long ans = 0;
  if (j == -1) {
    for (long long i = 0; i < k * n; i += k) ans += a[i];
  } else {
    long long v = 0;
    for (long long i = 0; i < n; i++) {
      ans += a[v++];
      for (long long h = 0; h < k - 1; h++) {
        if (j - v > n - i - 1)
          v++;
        else
          break;
      }
    }
  }
  cout << ans;
  return 0;
}

```