#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
int n,x,y,a,b;
cin >> n>>a>>b;
int c[202];
for (int i = 0; i < n; i ++ ){
cin >> x>>y;
c[i]=(a-x)*(a-x)+(b-y)*(b-y);
}
vector<pair<int, int>> arr;
for (int i = 0; i <n; i++) {
arr.push_back(make_pair(c[i], i));
}
sort(arr.begin(),arr.end());
for (int i = 0; i <3; i ++ ){
cout << arr[i].second+1<<endl;
}
return 0;
}