#include <bits/stdc++.h>
using namespace std;
long long a[2 * (int)1e5];
long long b[2 * (int)1e5];
int main(int argc, char* argv[]) {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(b, b + n);
  long long th = b[n - m * k];
  int nth = 1;
  while (n - m * k + nth < n && b[n - m * k + nth] == th) nth++;
  cout << accumulate(b + n - m * k, b + n, (long long)0) << endl;
  int curr = 0;
  for (int i = 0; i < n; i++) {
    if (curr == m) {
      cout << i << " ";
      curr = 0;
      k--;
      if (k <= 1) break;
    }
    if (a[i] > th) {
      curr++;
    } else if (a[i] == th && nth > 0) {
      curr++;
      nth--;
    }
  }
  cout << endl;
}
