#include <bits/stdc++.h>
using namespace std;
const long long int p_mod = 9999999999999983;
const long double pi = 3.14159265358979323;
const long long int N = 1e6 + 9;
const long long int mod = 1e9 + 7;
long long int a[N], b[N];
map<long long int, long long int> mp;
void solve() {
  long long int n, m, k, sum = 0;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; ++i) cin >> a[i], b[i] = a[i];
  sort(b + 1, b + n + 1);
  for (int i = n; i >= n - (m * k) + 1; --i) sum += b[i], mp[b[i]]++;
  cout << sum << '\n';
  long long int cnt = 0;
  for (int i = 1; i <= n; ++i) {
    if (mp[a[i]]) cnt++, mp[a[i]]--;
    if (cnt == m) {
      cnt = 0;
      cout << i << " ";
      k--;
      if (k == 1) break;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) solve();
}
