#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int a, b, c, d, e, f, g, h = 0, i;
  cin >> a >> b >> c;
  long long int kanishk[a], yash[a];
  for (d = 0; d < a; d++) {
    cin >> kanishk[d];
    yash[d] = kanishk[d];
  }
  sort(kanishk, kanishk + a);
  unordered_map<long long int, long long int> x;
  for (d = a - 1; d >= a - (b * c); d--) {
    if (x.find(kanishk[d]) == x.end())
      x[kanishk[d]] = 1;
    else
      x[kanishk[d]]++;
    h += kanishk[d];
  }
  cout << h << endl;
  h = 0;
  i = 0;
  for (d = 0; d < a; d++) {
    if (x.find(yash[d]) != x.end() && x[yash[d]] != 0) {
      h++;
      x[yash[d]]--;
    }
    if (h == b) {
      cout << d + 1 << " ";
      h = 0;
      i++;
    }
    if (i == (c - 1)) break;
  }
}
