#include <iostream>
#include <algorithm>
using namespace std;
struct data{
    int x,y,dist;
}v[10001];
int comp(data a,data b)
{
    return ((a.dist<b.dist) || ((a.dist==b.dist) && a.x<b.x) || (((a.dist==b.dist) && (a.x==b.x) && a.y<b.y)));
}
int main()
{
    long long n,xc,yc,k,i,x,y,nr=0;
    cin>>n>>k>>xc>>yc;
    for(i=1;i<=n;i++)
    {
        cin>>x>>y;
        v[i].x=x;v[i].y=y;
        x=x-xc;
        y=y-yc;
        x=x*x;
        y=y*y;
        x=x+y;
        v[i].dist=x;
    }
    sort(v+1,v+n+1,comp);
    for(i=1;i<=k;i++)
        cout<<v[i].x<<' '<<v[i].y<<'\n';
    return 0;
}