#include <bits/stdc++.h>
using namespace std;
map<int, int> ma;
int main() {
  int n, m, k, ind = 0;
  cin >> n >> m >> k;
  int rem = n - (m * k);
  int a[n], b[n], c[k];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(b, b + n);
  long long int count = 0;
  for (int i = n - 1; i >= rem; i--) ma[b[i]]++;
  for (int i = 0; i < n; i++) {
    if (ma[a[i]]) {
      count++;
      ma[a[i]]--;
    }
    if (count == m) {
      count = 0;
      c[ind++] = i + 1;
    }
  }
  count = 0;
  for (int i = n - 1; i >= rem; i--) count += b[i];
  cout << count << endl;
  for (int i = 0; i < k - 1; i++) cout << c[i] << " ";
}
