#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<long, long> a1, pair<long, long> a2) {
  return a1.second > a2.second;
}
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long n;
  cin >> n;
  long m;
  cin >> m;
  long k;
  cin >> k;
  long a[n];
  for (long i = 0; i <= n - 1; i++) cin >> a[i];
  ;
  vector<pair<long, long>> v;
  for (long i = 0; i <= n - 1; i++) {
    v.push_back(pair<long, long>(i, a[i]));
  }
  sort(v.begin(), v.end(), cmp);
  bool b[n];
  fill(b, b + n, false);
  long long sum = 0;
  for (long i = 0; i <= m * k - 1; i++) {
    b[v[i].first] = true;
    sum += a[v[i].first];
  }
  cout << sum << "\n";
  long count = 0;
  long out_count = 0;
  for (long i = 0; i <= n - 1; i++) {
    if (b[i]) {
      count++;
      if (count >= m) {
        cout << i + 1 << " ";
        count = 0;
        out_count++;
        if (out_count == k - 1) {
          break;
        }
      }
    }
  }
  return 0;
}
