#include <bits/stdc++.h>
using namespace std;
int n,m;
struct a{
	int hao;
	int num;
}x[100005];
bool cmp(a s,a q){
	if(s.num==q.num){
		return s.hao < q.hao;
	}else{
		return s.num < q.num;
	}
}
int main(){
	cin >> n >> m;
	for(int i = 1;i<=n;i++){
		x[i].hao = i;
		cin >> x[i].num;
	}
	sort(x+1,x+1+n,cmp);
	for(int i = 1;i<=n;i++){
		cout << x[i].hao << " ";
	}
}

题目是 https://www.luogu.com.cn/problem/P9472?contestId=118641