#include <bits/stdc++.h>
using namespace std;
struct elm {
  long long val, ind;
} v[200005];
long long a[200005], n, m, k, sum, nr1, nr2;
bool comp(elm a, elm b) {
  if (a.val == b.val) return (a.ind < b.ind);
  return (a.val > b.val);
}
bool comp2(elm a, elm b) { return (a.ind < b.ind); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  cin >> n >> m >> k;
  m *= k;
  for (long long i = 1; i <= n; ++i) cin >> a[i], v[i].val = a[i], v[i].ind = i;
  sort(v + 1, v + n + 1, comp);
  for (long long i = 1; i <= m; ++i) sum += v[i].val;
  sort(v + 1, v + m + 1, comp2);
  m /= k;
  nr1 = 1;
  cout << sum << '\n';
  for (long long i = 1; i <= n && nr1 < k; ++i) {
    ++nr2;
    if (nr2 == m) {
      nr2 = 0;
      ++nr1;
      cout << v[i].ind << ' ';
    }
  }
  return 0;
}
