#include<bits/stdc++.h>
using namespace std;
struct ikun{
	int x,y;	
	int sum,id;
}a[10005];
bool cmp(ikun a,ikun b){
	if(a.sum==b.sum){
		return a.id<b.id;
	}
	return a.sum<b.sum;       
}
int main(){
	int t,x,y;
	cin>>t>>x>>y;
	for(int i=1;i<=t;i++){
		cin>>a[i].x>>a[i].y;
		a[i].id=i; 
	}
	for(int i=1;i<=t;i++){
		a[i].sum=(x-a[i].x)*(x-a[i].x)+(y-a[i].y)*(y-a[i].y); 
	}	
	sort(a+1,a+t+1,cmp);
	for(int i=1;i<=3;i++){
		cout<<a[i].id<<"\n";
	}
	return 0;
}

#593. 称检测点查询 
import sys
input=sys.stdin.readline
n,X,Y=map(int,input().split())
a=[]
i=1
for _ in range(n):
	xi,yi=map(int,input().split())
	a.append((xi,yi,i))
	i+=1

a.sort(key=lambda p : ((p[0]-X)**2 )+ ((p[1]-Y)**2))
print(f"{a[0][2]}\n{a[1][2]}\n{a[2][2]}")