tj

#include<bits/stdc++.h>
using namespace std;
int num,n,m;
struct node{
int x,y,id;
};
node a[10000001];
bool cmp(node x,node y){
    if(x.x!=y.x) return x.x>y.x;
if(x.y!=y.y) return x.y<y.y;
return x.id<y.id;
}
int main(){
cin>>num>>n>>m;
for(int i=1;i<=num;i++){
	cin>>a[i].x>>a[i].y;
    a[i].id=i;
}
sort(a+1,a+1+num,cmp);
for(int i=1;i<=num;i++){
	if(a[i].x>=n&&a[i].y<=m){
		cout<<a[i].id<<" ";
	}
}
    return 0;
}