#include<bits/stdc++.h>
using namespace std;
int n,m,k,p[301000];
void No(){puts("impossible");exit(0);}
pair<int,int> a[300100];
#define fi first
#define se second
int main(){
    scanf("%d%d%d",&n,&m,&k);
    if(k%m||!k)No();
    k/=m;
    for(int i=1;i<=n;i++)scanf("%d",&a[i].fi),a[i].se=i;
    sort(a+1,a+n+1);
    int l=n-k,r=n-k+2;
    p[1]=a[n-k+1].se;
    int su=m;
    for(int i=2;i<=n;i++){
        int h=(su+i-2)/(i-1);
        if(l&&a[l].fi<h)p[i]=a[l--].se;
        else if(r<=n&&a[r].fi>=h)p[i]=a[r++].se,su+=m;
        else No();
    }
    for(int i=1;i<=n;i++)printf("%d ",p[i]);
    return 0;
}