#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<pair<int, int> > v;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(make_pair(x, i));
  }
  sort(v.begin(), v.end(), greater<pair<int, int> >());
  long long ans = 0;
  vector<int> pos;
  for (int i = 0; i < (m * k); i++) {
    ans += v[i].first;
    pos.push_back(v[i].second);
  }
  sort(pos.begin(), pos.end());
  vector<int> div;
  for (int i = 0; i < k - 1; i++) {
    div.push_back(pos[(i + 1) * m - 1]);
  }
  cout << ans << endl;
  for (int i = 0; i < div.size(); i++) {
    cout << div[i] + 1 << " ";
  }
  cout << endl;
}
