#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, m, k;
  cin >> n >> m >> k;
  long long int b[n];
  memset(b, 0, sizeof(b));
  vector<pair<long long int, long long int> > a;
  for (int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    a.push_back(make_pair(x, i));
  }
  sort(a.begin(), a.end());
  reverse(a.begin(), a.end());
  long long int sum = 0;
  for (int i = 0; i < k * m; i++) {
    b[a[i].second] = 1;
    sum += a[i].first;
  }
  long long int l = 0, p = 0;
  cout << sum << endl;
  for (int i = 0; i < n; i++) {
    l = l + b[i];
    if (l == m) {
      p++;
      cout << i + 1 << " ";
      l = 0;
    }
    if (p == k - 1) break;
  }
  cout << endl;
}
