#include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
map<int, int> mp;
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  sort(b, b + n);
  long long ans = 0;
  for (int i = 1; i <= m * k; i++) {
    ans += b[n - i];
    mp[b[n - i]]++;
  }
  printf("%lld\n", ans);
  int x = b[n - m * k], cnt = 0, ctt = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] >= x && mp[a[i]] > 0) {
      cnt++;
      mp[a[i]]--;
    }
    if (cnt == m) {
      printf("%d ", i + 1);
      cnt = 0;
      ctt++;
    }
    if (ctt == k - 1) break;
  }
}
