#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  cin >> n >> m >> k;
  vector<int> v(n);
  vector<pair<int, int> > vp(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    vp[i] = make_pair(v[i], i);
  }
  sort(begin(vp), end(vp), greater<pair<int, int> >());
  long long ans = 0;
  set<int> s;
  for (int i = 0; i < m * k; i++) {
    s.insert(vp[i].second);
    ans += vp[i].first;
  }
  cout << ans << endl;
  long long cnt = 0, cnt2 = 0;
  for (int i = 0; i < n; i++) {
    if (s.count(i)) {
      cnt2++;
      if (cnt2 == m) {
        cnt2 = 0;
        cout << i + 1 << ' ';
        cnt++;
        if (cnt == k - 1) {
          break;
        }
      }
    }
  }
}
