//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder; //https://github.com/atcoder/ac-library

#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define bit(n, k) ((n >> k) & 1)
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int, int> pii;

void test_case(int tt){
    int n,m,k; cin>>n>>m>>k;
    if(k%m){
        cout<<"impossible\n";
        return;
    }
    k/=m;
    vector<pii> a(n);
    rep(i,0,n)cin>>a[i].first,a[i].second=i+1;
    sort(all(a));
    vector<int> ans(n,0);
    ans[0]=a[n-k].second;
    int l=n-k-1,r=n-k+1;
    ll sum=m;
    rep(i,1,n){
        if(l>=0 && 1LL*a[l].first*i<sum)ans[i]=a[l--].second;
        else if(r<n && 1LL*a[r].first*i>=sum)ans[i]=a[r++].second,sum+=m;
        else{
            cout<<"impossible\n";
            return;
        }
    }
    rep(i,0,n)cout<<ans[i]<<' ';
    return;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    //cin>>t;
    rep(i, 1, t + 1)
    {
        test_case(i);
    }
    return 0;
}