#include <bits/stdc++.h>
#pragma GCC optimize("-O2")
using namespace std;
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << "\t";
  err(++it, args...);
}
template <typename T1, typename T2>
ostream& operator<<(ostream& c, pair<T1, T2>& v) {
  c << "(" << v.first << "," << v.second << ")";
  return c;
}
template <template <class...> class TT, class... T>
ostream& operator<<(ostream& out, TT<T...>& c) {
  out << "{ ";
  for (auto& x : c) out << x << " ";
  out << "}";
  return out;
}
const int LIM = 2e5 + 5, MOD = 1e9 + 7;
int t, n, m, k, x, y;
int a[LIM], b[LIM];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  for (int i = 0; i < n; ++i) cin >> a[i], b[i] = i;
  sort(b, b + n, [&](int i, int j) { return a[i] > a[j]; });
  long long int ans = 0;
  int till = m * k;
  for (int i = 0; i < till; ++i) {
    ans += a[b[i]];
  }
  for (int i = 0; i < n; ++i) {
    a[b[i]] = i;
  }
  int ptr = 0, curr = 0, done = 0;
  cout << ans << "\n";
  while (ptr < n) {
    if (curr == m) {
      if (done < k - 1) cout << ptr << " ";
      ++done;
      curr = 0;
    }
    if (a[ptr] < till) curr++;
    ++ptr;
  }
  return 0;
}
