#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int INF = 0x7f7f7f7f;
int a[MAX + 1], ans[MAX + 1], chk[MAX + 1], m, k;
long long sum = 0LL;
priority_queue<pair<int, int> > pq;
int main(int argc, char *argv[]) {
  int n, i, j, cnt = 0;
  scanf("%d %d %d", &n, &m, &k);
  for (i = 0; i < n; ++i) scanf("%d", a + i), pq.push({a[i], i});
  for (i = 0; i < m * k; ++i) {
    pair<int, int> cur = pq.top();
    pq.pop();
    chk[cur.second] = 1;
    sum += cur.first;
  }
  cnt = 0;
  for (i = 0, j = 0; i < n; ++i) {
    if (chk[i]) ++cnt;
    if (cnt == m) {
      ans[j++] = i + 1;
      cnt = 0;
    }
  }
  printf("%lld\n", sum);
  for (i = 0; i < k - 1; ++i) printf("%d ", ans[i]);
  return !printf("\n");
}
