ds

#include <bits/stdc++.h>
using namespace std;
int a[1000000];
int k;
struct node{
int val,id;
friend bool operator <(const node &a,const node&b){
if(a.val != b.val){
return a.val<b.val;
}
else{
return a.id>b.id;
}
}
};
int main(){
freopen("monster.in","r",stdin);
freopen("monster.out","w",stdout);
int n,k;
cin >>n>>k;
priority_queue<node>g;
for(int i = 1;i<=n;i++){
int val;
cin >>val;
g.push({val,i});
}
while(!g.empty()){
node fr = g.top();
g.pop();
fr.val -= k;
if(fr.val <=0){
cout <<fr.id<<" ";
continue;
}
g.push(fr);
}
fclose(stdin);
fclose(stdout);
return 0;
}