#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  vector<int> a(n);
  vector<pair<int, int> > A;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    A.push_back({a[i], i});
  }
  sort(A.begin(), A.end(), greater<pair<int, int> >());
  long long sum = 0;
  vector<int> pick(n);
  for (int i = 0; i < m * k; ++i) {
    sum += A[i].first;
    pick[A[i].second] = true;
  }
  int i = 0;
  vector<int> ret;
  for (int u = 0; u < k; ++u) {
    int cnt = 0;
    for (; i < n && cnt < m; ++i) cnt += pick[i];
    ret.push_back(i);
  }
  ret.pop_back();
  printf("%lld\n", sum);
  for (int i = 0; i < k - 1; ++i) {
    printf("%d%c", ret[i], " \n"[i + 1 == k - 1]);
  }
  return 0;
}
