#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int cnt[N];
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  vector<int> a(n), b;
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]), b.push_back(a[i]);
  sort(b.begin(), b.end());
  int pos = n - m * k;
  int x = b[pos], cnt = 0;
  for (int i = pos - 1; ~i && b[i] == x; --i) ++cnt;
  long long sum = 0;
  for (int i = 1; i <= m * k; ++i) sum += b[n - i];
  cout << sum << endl;
  pos = 0;
  for (int i = 1; i < k; ++i) {
    for (int j = 0; j < m; ++j, ++pos)
      while (a[pos] == x && cnt-- > 0 || a[pos] < x) ++pos;
    cout << pos << ' ';
  }
  return 0;
}
