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