#include <bits/stdc++.h>
using namespace std;
int read() {
  int tot = 0, fh = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fh = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    tot = tot * 10 + c - '0';
    c = getchar();
  }
  return tot * fh;
}
void getstr(char *a) {
  char c = getchar();
  int len = 0;
  while (!((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z') ||
           (c >= '0' && c <= '9')))
    c = getchar();
  while ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z') ||
         (c >= '0' && c <= '9')) {
    a[++len] = c;
    c = getchar();
  }
}
const int maxn = 4e5 + 100;
long long n, m, k, num, sum;
struct compass {
  int x, y;
} a[maxn];
bool cmp1(compass x, compass y) { return x.x < y.x; }
bool cmp2(compass x, compass y) { return x.y < y.y; }
int main() {
  n = read();
  m = read();
  k = read();
  for (int i = 1; i <= n; i++) {
    a[i].x = read();
    a[i].y = i;
  }
  sort(a + 1, a + n + 1, cmp1);
  for (int i = 1; i <= n - m * k; i++) a[i].x = 2000000000;
  for (int i = n - m * k + 1; i <= n; i++) sum += a[i].x;
  cout << sum << "\n";
  sort(a + 1, a + n + 1, cmp2);
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i].x != 2000000000) num++;
    if (num == m) {
      num = 0;
      cout << i << " ";
      cnt++;
      if (cnt == k - 1) break;
    }
  }
  return 0;
}
