#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 210;
pair<int, int> p[N];
int n, X, Y;
int main(){
cin >> n >> X >> Y;
for(int i = 1; i <= n; i ++){
int x, y;
cin >> x >> y;
p[i].first = (X - x) * (X - x) + (Y - y) * (Y - y);
p[i].second = i;
}
sort(p + 1, p + n + 1);
for(int j = 1; j <= 3; j ++) cout << p[j].second << endl;
return 0;
}
09-04
247
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountBlack.png)
09-03
826
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountBlack.png)
08-30
3721
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountBlack.png)