#include <bits/stdc++.h>   using namespace std;   long long num[200000];   pair<long long, long long> p[200000];   int main() {     long long n, m, k, sum = 0, cnt = 1;     cin >> n >> m >> k;     for (int i = 1; i <= n; i++) {       cin >> p[i].first;       p[i].second = i;     }     sort(p + 1, p + n + 1);     for (int i = n; i > n - m * k; i--) {       sum += p[i].first;       num[cnt++] = p[i].second;     }     cout << sum <<   n ;     sort(num + 1, num + m * k + 1);     for (int i = m; i < m * k; i += m) cout << num[i] <<    ;     return 0;   }   