#include <bits/stdc++.h>
using namespace std;
int n, m, k, t, a[200010], f[200010];
long long ans;
struct nood {
  int x, id;
} b[200010];
int cmp(nood a, nood b) { return a.x > b.x; }
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    b[i].x = a[i];
    b[i].id = i;
  }
  sort(b + 1, b + n + 1, cmp);
  for (int i = 1; i <= m * k; i++) {
    f[b[i].id] = 1;
    ans = ans + b[i].x;
  }
  printf("%lld\n", ans);
  for (int i = 1; i <= n; i++) {
    if (f[i] == 1) t++;
    if (t == m + 1) {
      printf("%d ", i - 1);
      t = 1;
    }
  }
}
