#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[200002], b[200002];
int main() {
  long long n, m, k, i, j, s = 0;
  cin >> n >> m >> k;
  for (i = 0; i < n; i++) cin >> a[i].first, a[i].second = i + 1;
  sort(a, a + n);
  for (i = n - 1, j = 0; i >= n - m * k; i--, j++) {
    b[j] = {a[i].second, a[i].first};
    s += 1LL * a[i].first;
  }
  sort(b, b + j);
  cout << s << "\n";
  for (i = 1; i < k; i++) cout << b[i * m - 1].first << " ";
  return 0;
}
