#include <bits/stdc++.h>
using namespace std;
int n, m, k, a[200000 + 1000], r[200000 + 1000];
bool cmp(int i, int j) { return a[i] > a[j]; }
int main() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) r[i] = i;
  sort(r + 1, r + 1 + n, cmp);
  sort(r + 1, r + 1 + m * k);
  long long sum = 0;
  for (int i = 1; i <= m * k; i++) sum += a[r[i]];
  cout << sum << endl;
  for (int i = m; i < m * k; i += m) cout << r[i] << " ";
  cout << endl;
  return 0;
}
