#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 1010;
struct node{
    int x, y;
    double dis;
    int id;
}a[N];
bool cmp(node t, node q){
    if(abs(t.dis - q.dis) >= 1e-5)  return t.dis < q.dis;
    return t.id < q.id;
}
int main(){
    int n, x, y;    scanf("%d%d%d", &n, &x, &y);
    for(int i = 1; i<= n; i ++ ){
        scanf("%d%d", &a[i].x, &a[i].y);
        a[i].id = i;
        a[i].dis = sqrt(pow(a[i].x - x, 2) + pow(a[i].y - y, 2));
    }
    sort(a + 1, a + n + 1, cmp);
    for(int i = 1; i <= 3; i ++ )   cout << a[i].id << endl;
    return 0;
}