#include<bits/stdc++.h>
using namespace std;

const int N=210;
struct Dist{
    int id,x,y;
    double dist;
    bool operator< (const Dist& t) const {
        if(dist!=t.dist) return dist<t.dist;
        else return id<t.id;
    }
}p[N];

int main(){
    int n,x,y;
    cin>>n>>x>>y;

    for(int i=0;i<n;i++){
        cin>>p[i].x>>p[i].y;
        p[i].id=i+1;
        p[i].dist=sqrt((x-p[i].x)*(x-p[i].x)+(y-p[i].y)*(y-p[i].y));
    }

    sort(p,p+n);

    for(int i=0;i<3;i++) 
        cout<<p[i].id<<endl;

    return 0;
}