#include <bits/stdc++.h>
using namespace std;
int n, m, k, a[((int)1e6 + 10)];
multiset<int> s;
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    s.insert(a[i]);
  }
  while (s.size() > m * k) {
    s.erase(s.begin());
  }
  long long sum = 0;
  for (auto x : s) {
    sum += x;
  }
  cout << sum << endl;
  int num = k - 1;
  for (int i = 0; i < n; i++) {
    if (s.find(a[i]) != s.end()) {
      s.erase(s.find(a[i]));
      if (num && s.size() % m == 0) {
        cout << (i + 1) << " ";
        num--;
      }
    }
  }
  cout << endl;
  return 0;
}
