#include <bits/stdc++.h>
using namespace std;
int n, m, k;
long long ans, tot, sum;
bool ok[200005];
struct node {
  int x, id;
} a[200005];
bool cmp(node a, node 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].x);
    a[i].id = i;
  }
  sort(a + 1, a + 1 + n, cmp);
  for (int i = 1; i <= m * k; i++) {
    ans += a[i].x;
    ok[a[i].id] = 1;
  }
  printf("%I64d\n", ans);
  int now = 1;
  for (int i = 1; now < k; i++) {
    if (ok[i]) sum++;
    if (sum == m) {
      printf("%d ", i);
      sum = 0;
      now++;
    }
  }
  return 0;
}
