#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<int> v(n);
  for (int i = 0; i < n; i++) v[i] = a[i];
  sort(v.begin(), v.end());
  long long int sum = 0;
  unordered_map<int, int> umap;
  for (int i = n - 1; i >= n - m * k; i--) {
    sum = sum + v[i];
    if (umap.find(v[i]) == umap.end())
      umap[v[i]] = 1;
    else
      umap.find(v[i])->second++;
  }
  cout << sum << endl;
  int i = 0;
  k--;
  while (i < n) {
    int x = m;
    while (i < n && x) {
      if (umap.find(a[i]) != umap.end() && umap.find(a[i])->second) {
        umap.find(a[i])->second--;
        x--;
      }
      i++;
    }
    k--;
    cout << i << " ";
    if (k == 0) i = n;
  }
  return 0;
}
