https://codeforces.com/problemset/problem/1526/B
#include<bits/stdc++.h>
using namespace std;
const int N=110;
vector< pair<int,int> > ve[110];
bool cmp(pair<int,int> a,pair<int,int> b)
{
if(a.first==b.first)
return a.second<b.second;
return a.first>b.first;
}
int main(void)
{
int n,m; cin>>n>>m;
for(int i=1;i<=n;i++)
{
int id,cnt; cin>>id>>cnt;
ve[id].push_back({cnt,i});
}
for(int i=1;i<=m;i++) sort(ve[i].begin(),ve[i].end(),cmp);
for(int i=1;i<=m;i++) cout<<ve[i][0].second<<" ";
return 0;
}