#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 6;
int n, m;
int a[N];
struct Node {
	int x, v;
}b[N];
bool cmp(Node c, Node d) {
	return c.v < d.v;
}
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		int x;
		scanf("%d", &x);
		int flag = x;
		for (int j = 1; j <= m; ++j)
			flag += flag * i;
		b[i].v = flag;
		b[i].x = i;
	}
	sort(b + 1, b + n + 1, cmp);
	for (int i = 1; i <= n; ++i)
	    printf("%d ", b[i].x);
	return 0;
}