#include<bits/stdc++.h>
using namespace std;
int n,m,k,A[1<<20],s,l,r,x;
pair<int,int>p[1<<20];
int main(){
	cin>>n>>m>>k;
	if(k%m!=0||k==0)
		cout<<"impossible\n",exit(0);
	k/=m;
	for(int i=1;i<=n;i++)
		cin>>x,p[i]={x,i};
	sort(p+1,p+n+1),l=n-k,r=n-k+2,A[1]=p[n-k+1].second,s=1;
	for(int i=2;i<=n;i++){
		if(l&&s*m>p[l].first*(i-1)){
			A[i]=p[l--].second;
			continue;
		}
		if(r<=n&&s*m<=p[r].first*(i-1)){
			A[i]=p[r++].second,s++;
			continue;
		}
		cout<<"impossible\n",exit(0);
	}
	for(int i=1;i<=n;i++)
		cout<<A[i]<<" \n"[i==n];
}