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