#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int N = 1e6 * 5;
unordered_map<int, int> m;
vector<int> v;
int main() {
  int n, i, b[210000], m1, k, a[210000];
  cin >> n >> m1 >> k;
  for (i = 0; i < n; b[i] = a[i], i++) cin >> a[i];
  sort(b, b + n);
  long long sum = 0;
  for (i = n - 1; i >= n - k * m1; i--) m[b[i]]++, sum += b[i];
  int k1 = 0;
  for (i = 0; i < n; i++) {
    if (m[a[i]]) k1++, m[a[i]]--;
    if (k1 == m1) k1 = 0, v.emplace_back(i + 1);
  }
  cout << sum << "\n";
  for (i = 0; i < v.size() - 1; i++) cout << v[i] << " ";
}
