#include <bits/stdc++.h>
using namespace std;
long long n, m, k, a;
priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,
               greater<pair<long long, long long>>>
    pq;
priority_queue<long long, vector<long long>, greater<long long>> q;
signed main() {
  cin >> n >> m >> k;
  for (long long i = 0; i < n; i++) {
    cin >> a;
    pq.push({a, i + 1});
  }
  a = 0;
  while (pq.size() > m * k) pq.pop();
  while (pq.size()) {
    q.push(pq.top().second);
    a += pq.top().first;
    pq.pop();
  }
  cout << a << '\n';
  for (long long i = 1; i < k; i++) {
    for (long long j = 1; j < m; j++) q.pop();
    cout << q.top() << ' ';
    q.pop();
  }
}
