#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k;
  long long sum = 0;
  scanf("%d%d%d", &n, &m, &k);
  vector<pair<int, int>> v;
  bool vis[n];
  memset(vis, 0, n * sizeof vis[0]);
  int tot = m, cnt = 0;
  int arr[n];
  for (int i = 0; i < n; ++i) {
    scanf("%d", arr + i);
    v.push_back({arr[i], i});
  }
  sort(v.rbegin(), v.rend());
  for (int i = 0; i < m * k; ++i) {
    sum += v[i].first;
    vis[v[i].second] = 1;
  }
  cout << sum << endl;
  for (int i = 0; i < n; i++) {
    if (vis[i] == 1) {
      tot--;
      if (tot == 0) {
        cout << i + 1 << " ";
        cnt++;
        tot = m;
      }
      if (cnt == k - 1) break;
    }
  }
  return 0;
}
