#include <bits/stdc++.h>
using namespace std;
const int N = 200002;
int n, m, k;
bool b[N];
struct node {
  int id;
  long long w;
} a[N];
inline int read() {
  int x = 0, k = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') k = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - 48, c = getchar();
  return x * k;
}
bool cmp(const node &p, const node &q) {
  if (p.w != q.w) return p.w > q.w;
  return p.id < q.id;
}
int main() {
  n = read(), m = read(), k = read();
  for (int i = 1; i <= n; ++i) a[i].w = read(), a[i].id = i;
  sort(a + 1, a + 1 + n, cmp);
  long long ans = 0;
  for (int i = 1; i <= m * k; ++i) ans += a[i].w, b[a[i].id] = 1;
  printf("%lld\n", ans);
  for (int i = 1, cnt, tot = 0; i <= n; ++i) {
    cnt = 0;
    while (i <= n && cnt < m) {
      if (b[i]) ++cnt;
      ++i;
    }
    ++tot, --i;
    if (tot != k && i != n) printf("%d ", i);
  }
  puts("");
  return 0;
}
