#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, m, k, counti = 0, q = 0, sum = 0;
  cin >> n >> m >> k;
  unordered_map<long long int, long long int> mp;
  long long int a[n], b[n];
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(b, b + n);
  long long int x = m * k;
  long long int y = n - x;
  for (long long int i = y; i < n; i++) {
    mp[b[i]]++;
    sum += b[i];
  }
  cout << sum << "\n";
  for (long long int i = 0; i < n; i++) {
    if (mp[a[i]] > 0) {
      counti++;
      mp[a[i]]--;
    }
    if (counti == m) {
      cout << i + 1 << " ";
      counti = 0;
      q++;
    }
    if (q == k - 1) break;
  }
  cout << "\n";
  return 0;
}
