#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int n, m, k;
  cin >> n >> m >> k;
  long long int a[n + 1];
  for (int i = 0; i < n; i++) cin >> a[i];
  set<long long int> s;
  map<long long int, int> pl;
  priority_queue<long long int> pq;
  for (int i = 0; i < n; i++) pq.push(a[i]);
  long long int i = 0, sum = 0;
  while (i < m * k) {
    sum += pq.top();
    s.insert(pq.top());
    pl[pq.top()]++;
    pq.pop();
    i++;
  }
  vector<long long int> p;
  long long int c = 0;
  for (int i = 0; i < n; i++) {
    if (s.count(a[i])) {
      c++;
      if (pl[a[i]] == 1) s.erase(a[i]);
      pl[a[i]]--;
    }
    if (p.size() == k - 1) break;
    if (c == m) p.push_back(i + 1), c = 0;
  }
  cout << sum << "\n";
  for (long long int i : p) cout << i << " ";
  return 0;
}
