#include <bits/stdc++.h>
const int INF = 1e9 + 1;
const int MOD = 1e9 + 7;
const int N = 1e6 + 1;
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int n, m, k, a, b;
  cin >> n >> m >> k;
  vector<pair<long long int, long long int> > vec;
  for (int i = 0; i < n; i += 1) {
    cin >> a;
    vec.push_back(make_pair(a, i + 1));
  }
  sort(vec.begin(), vec.end(), greater<pair<long long int, long long int> >());
  vector<long long int> v(m * k);
  long long int sum = 0;
  for (int i = 0; i < m * k; i++) {
    sum += vec[i].first;
    v[i] = (vec[i].second);
  }
  sort(v.begin(), v.end());
  cout << sum << endl;
  for (int i = 1; i < k; i++) {
    cout << v[i * m - 1] << " ";
  }
  cout << endl;
}
