#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int n;
  scanf("%d", &n);
  return n;
}
inline void out(int n) { printf("%d ", n); }
struct triple {
 public:
  int x;
  int y;
  int a;
};
int main() {
  int n = in();
  int m = in();
  int k = in();
  vector<pair<int, int> > data(n);
  for (int i = 0; i < n; i++) {
    data[i].first = in();
    data[i].second = i;
  }
  sort(data.begin(), data.end(), greater<pair<int, int> >());
  vector<int> indices(m * k);
  long long maxBeauty = 0;
  for (int i = 0; i < m * k; i++) {
    maxBeauty += data[i].first;
    indices[i] = data[i].second;
  }
  cout << maxBeauty << endl;
  sort(indices.begin(), indices.end());
  for (int i = 0; i < k - 1; i++) {
    cout << indices[(i + 1) * m - 1] + 1 << " ";
  }
  return 0;
}
