#include <bits/stdc++.h>
using namespace std;
int n, m, k;
vector<pair<int, int> > a;
bool b[200005];
long long beauty;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++) {
    int tmp;
    scanf("%d", &tmp);
    a.push_back(make_pair(tmp, i));
  }
  sort(a.begin(), a.end(), std::greater<pair<int, int> >());
  for (int i = 0; i < m * k; i++) {
    beauty += (long long)a[i].first;
    b[a[i].second] = 1;
  }
  printf("%lld\n", beauty);
  int ct = 0;
  int printed = 0;
  for (int i = 1; i <= n; i++) {
    if (b[i]) ct++;
    if (ct == m) {
      printf("%d ", i);
      ct = 0;
      printed++;
    }
    if (printed == k - 1) break;
  }
  printf("\n");
  return 0;
}
