#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;

const int NN = 2e5+5;
int N, M, K;
pair<int, int> A[NN];

int tmp[NN];
int calculate(){
    int ans = 0;
    tmp[0] = M;
    for(int i=0;i<N;i++){
        tmp[i]=i*A[i].first;
        // cout<<A[i].first<<' ';
    }
    // cout<<'\n';
    for(int i=0;i<N;i++){
        if(tmp[i]>=M*ans){
            ans++;
        }
    }
    // cout<<'\n'<<'\n';
    return ans;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>N>>M>>K;
    for(int i=0;i<N;i++){
        cin>>A[i].first;
        A[i].second = i+1;
    }
    if(K%M){
        cout<<"impossible";
        return 0;
    }
    K/=M;
    sort(A, A+N);
    int hi = calculate();
    reverse(A, A+N);
    int lo = calculate();
    if(K<lo||hi<K){
        cout<<"impossible";
        return 0;
    }
    if(K==lo){
        for(int i=0;i<N;i++)cout<<A[i].second<<' ';
        return 0;
    }
    reverse(A, A+N);
    if(K==hi){
        for(int i=0;i<N;i++)cout<<A[i].second<<' ';
        return 0;
    }
    // reverse(A, A+N);
    int l = lo, h = hi, t=1000;
    while(t--&&lo+1<hi){
        int mid = lo+hi>>1;
        // cout<<lo<<' '<<hi<<endl;
        reverse(A+mid, A+N);
        int rst = calculate();
        if(K==rst){
            for(int i=0;i<N;i++)cout<<A[i].second<<' ';
            return 0;
        }
        if(rst<K){
            lo = rst;
        }
        else hi = rst;
        reverse(A+mid, A+N);
    }
    lo = l, hi = h, t = 1000;
    reverse(A, A+N);
    while(t--&&lo+1<hi){
        int mid = lo+hi>>1;
        reverse(A+mid, A+N);
        int rst = calculate();
        if(K==rst){
            for(int i=0;i<N;i++)cout<<A[i].second<<' ';
            return 0;
        }
        if(rst<K){
            lo = rst;
        }
        else hi = rst;
        reverse(A+mid, A+N);
    }

    cout<<"impossible";
    return 0;
}