#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(228);
const int maxn = 2e5;
pair<int, int> a[maxn];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; ++i) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a, a + n);
  reverse(a, a + n);
  vector<int> ve;
  long long ans = 0;
  for (int i = 0; i < m * k; ++i) {
    ans += a[i].first;
    ve.push_back(a[i].second);
  }
  cout << ans << '\n';
  sort(ve.begin(), ve.end());
  int cnt = 0;
  for (int i = 0; i < (int)ve.size(); ++i) {
    ++cnt;
    if (cnt == m && i != (int)ve.size() - 1) {
      cout << ve[i] + 1 << ' ';
      cnt = 0;
    }
  }
}
