#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k, i;
  cin >> n >> m >> k;
  vector<pair<int, int> > a(n);
  for (i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].first = -a[i].first;
    a[i].second = i + 1;
  }
  sort(a.begin(), a.end());
  vector<bool> b(n + 1, 0);
  long long s = 0;
  for (i = 0; i < k * m; i++) {
    b[a[i].second] = 1;
    s -= a[i].first;
  }
  cout << s << endl;
  int c = 0;
  for (i = 1; i <= n; i++) {
    if (b[i]) c++;
    if (c == m && k > 1) {
      cout << i << " ";
      k--;
      c = 0;
    }
  }
}
