#include <bits/stdc++.h>
long double pi = 3.14159265358979;
using namespace std;
int inf = 1e9;
long long int MOD = 1e9 + 7;
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
void solve() {}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  set<pair<int, int>> s;
  vector<bool> a(n, false);
  for (int i = 0; i < n; i++) {
    int c;
    cin >> c;
    s.insert({c, i});
  }
  long long int sum = 0;
  for (int j = 0; j < k * m; j++) {
    pair<int, int> p = *prev(s.end());
    s.erase(prev(s.end()));
    a[p.second] = true;
    sum += p.first;
  }
  int count = 0;
  cout << sum << "\n";
  ;
  int c = 0;
  for (int i = 0; i < n - 1; i++) {
    if (count == k - 1) break;
    if (a[i]) c++;
    if (c == m) {
      cout << i + 1 << " ";
      c = 0;
      count++;
    };
  }
}
