#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> a(n);
  vector<pair<int, int>> b(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[i].first = a[i];
    b[i].second = i;
  }
  sort(b.begin(), b.end(), greater<pair<int, int>>());
  vector<bool> h(n, 0);
  long long ans = 0;
  for (int i = 0; i < m * k; i++) {
    ans += b[i].first;
    h[b[i].second] = 1;
  }
  cout << ans << endl;
  int used = 0, disp = 0;
  for (int i = 0; i < n; i++) {
    if (h[i]) {
      used++;
      h[i] = 0;
      if (used == m && disp < k - 1) {
        cout << i + 1 << " ";
        disp++;
        used = 0;
      }
    }
  }
  cout << endl;
  return 0;
}
