#include <bits/stdc++.h>   using namespace std;   struct sir {     int val, ind;   };   sir sv[200005];   int n, m, k, v[200005], part[200005], t = 0;   long long sum = 0;   bool B[200005];   bool comp(sir X, sir Y) { return X.val > Y.val; }   int main() {     cin >> n >> m >> k;     for (int i = 1; i <= n; ++i) {       cin >> v[i];       sv[i].val = v[i];       sv[i].ind = i;     }     sort(sv + 1, sv + n + 1, comp);     for (int i = 1; i <= m * k; ++i) {       B[sv[i].ind] = 1;       sum += sv[i].val;     }     int nr = 0;     for (int i = 1; i <= n; ++i) {       if (B[i]) nr++;       if (nr == m && t < k - 1) {         nr = 0;         part[++t] = i;       }     }     cout << sum <<   n ;     for (int i = 1; i <= t; ++i) cout << part[i] <<    ;   }   