#include <bits/stdc++.h>
int main() {
  int n, k, m;
  std::cin >> n >> m >> k;
  std::vector<std::pair<long long, int>> D(n);
  std::vector<long long> F(n);
  std::vector<int> P(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> D[i].first;
    D[i].second = i;
    F[i] = D[i].first;
  }
  std::sort(D.rbegin(), D.rend());
  for (int i = 0; i < n; ++i) {
    P[D[i].second] = i + 1;
  }
  int cur = 0;
  std::vector<int> ans;
  for (int i = 0; i < n; ++i) {
    if (P[i] <= k * m) {
      ++cur;
      if (cur % m == 0 && cur / m != k) {
        ans.push_back(i + 1);
      }
    }
  }
  long long sum = 0;
  for (int i = 0; i < k * m; ++i) {
    sum += D[i].first;
  }
  std::cout << sum << "\n";
  for (int i = 0; i < ans.size(); ++i) {
    std::cout << ans[i] << " ";
  }
  return 0;
}
