#include <bits/stdc++.h>
using namespace std;
long long arr[200010];
map<long long, long long> ma;
set<long long> st;
bool visited[200010];
vector<pair<long long, long long> > vec2;
vector<long long> vec;
priority_queue<long long, vector<long long>, greater<long long> > pq;
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    vec.push_back(arr[i]);
  }
  sort(vec.begin(), vec.end(), greater<long long>());
  long long ans = 0;
  for (int i = 0; i < m * k; i++) {
    ma[vec[i]]++;
    ans += vec[i];
  }
  cout << ans << endl;
  int cnt = 0, c2 = 0;
  for (int i = 0; i < n; i++) {
    if (ma.find(arr[i]) != ma.end() && ma[arr[i]] > 0) {
      cnt++;
      ma[arr[i]]--;
    }
    if (cnt == m && c2 < k - 1) {
      c2++;
      cnt = 0;
      cout << (i + 1) << " ";
    }
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
