#include <bits/stdc++.h>
using namespace std;
int a[200010];
int mrk[200010];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  priority_queue<pair<int, int> > pq;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    pq.push(make_pair(a[i], i));
  }
  int oo = m * k;
  long long ans = 0;
  for (int i = 0; i < oo; i++) {
    pair<int, int> yy = pq.top();
    pq.pop();
    ans += yy.first;
    mrk[yy.second] = 1;
  }
  cout << ans << endl;
  int cnt = 0;
  int uu = 0;
  for (int i = 0; i < n; i++) {
    if (mrk[i] == 1) {
      cnt++;
      if (cnt == m) {
        uu++;
        if (uu == k) {
          return 0;
        }
        cout << i + 1 << " ";
        cnt = 0;
      }
    }
  }
}
