#include <bits/stdc++.h>
using namespace std;
const long long N = 200000 + 100;
long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
struct node {
  long long x, id, bz;
} a[N];
long long ans[N], tot, anss;
bool cmp1(node x, node y) { return x.x > y.x; }
bool cmp2(node x, node y) { return x.id < y.id; }
signed main() {
  long long n = read(), m = read(), k = read();
  for (long long i = 1; i <= n; ++i) {
    a[i].x = read();
    a[i].id = i;
  }
  sort(a + 1, a + n + 1, cmp1);
  for (long long i = 1; i <= m * k; ++i) a[i].bz = 1, anss += a[i].x;
  sort(a + 1, a + n + 1, cmp2);
  long long now = 0;
  for (long long i = 1; i <= n; ++i) {
    now += a[i].bz;
    if (now == m) {
      now = 0;
      ans[++tot] = i;
    }
  }
  printf("%I64d\n", anss);
  for (long long i = 1; i < k; ++i) {
    printf("%I64d ", ans[i]);
  }
  return 0;
}
