#include <bits/stdc++.h>
using namespace std;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const long long NLINF = 0xf7f7f7f7f7f7f7f7;
const int INF = 0x3f3f3f3f, NINF = 0xf7f7f7f7;
const int MOD1 = 1e9 + 7, MOD2 = 1e9 + 9;
const int N = 2e5 + 10;
map<int, int> mark;
int n, m, k, a[N], aux[N], p[N];
long long s = 0LL;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), aux[i] = a[i], s += a[i];
  sort(aux + 1, aux + n + 1);
  for (int i = 1; i <= n - m * k; i++) s -= aux[i], mark[aux[i]]++;
  int sz_mx = n - m * (k - 1);
  int last = 1, cur = 0, cut = 0;
  for (int i = 1; i <= n; i++) {
    if (mark[a[i]]) cur++, --mark[a[i]];
    ;
    if (i - last + 1 >= m) {
      if ((i - last + 1 - cur == m or i - last + 1 == sz_mx) && cut < k - 1)
        p[++cut] = i, last = i + 1, cur = 0;
    }
  }
  printf("%lld\n", s);
  for (int i = 1; i < k; i++) printf("%d ", p[i]);
  puts("");
}
