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