#include <bits/stdc++.h>
using namespace std;
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
bool sortinasc(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<pair<int, int> > v;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    v.push_back({x, i});
  }
  sort(v.begin(), v.end(), sortinrev);
  int c = m * k;
  long long sum = 0;
  for (int i = 0; i < c; i++) sum += v[i].first;
  cout << sum << "\n";
  int count = 0;
  vector<pair<int, int> > v1;
  for (int i = 0; i < c; i++) {
    v1.push_back(v[i]);
  }
  sort(v1.begin(), v1.end(), sortinasc);
  for (int i = 0; i < v1.size(); i++) {
    if ((i + 1) % m == 0) count++, cout << v1[i].second << " ";
    if (count == (k - 1)) break;
  }
  return 0;
}
